Pages that link to "Item:Q4268718"
From MaRDI portal
The following pages link to Computing with Very Weak Random Sources (Q4268718):
Displaying 13 items.
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Better short-seed quantum-proof extractors (Q764353) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly (Q2828212) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Optimal Coin Flipping (Q5418975) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- (Q5875519) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
