The following pages link to Randomness is linear in space (Q1915503):
Displaying 50 items.
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy (Q2947523) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources (Q2956041) (← links)
- When Are Fuzzy Extractors Possible? (Q2958123) (← links)
- Bounded-Retrieval Model with Keys Derived from Private Data (Q2980861) (← links)
- Secure and Private, yet Lightweight, Authentication for the IoT via PUF and CBKA (Q2988331) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- From Indifferentiability to Constructive Cryptography (and Back) (Q3179350) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (Q3448780) (← links)
- Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
- Reproducible Circularly-Secure Bit Encryption: Applications and Realizations (Q3457112) (← links)
- Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint (Q3460111) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- An Improved Robust Fuzzy Extractor (Q3540042) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- Key Agreement from Close Secrets over Unsecured Channels (Q3627436) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- On extractors and exposure‐resilient functions for sublogarithmic entropy (Q4921889) (← links)
- (Q5009532) (← links)
- Preserving Randomness for Adaptive Algorithms (Q5009539) (← links)
- Extractors for weak random sources and their applications (Q5054851) (← links)
- Fooling Polytopes (Q5066946) (← links)
- (Q5091189) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- (Q5091780) (← links)
- (Q5092453) (← links)
- (Q5092457) (← links)
- (Q5092476) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
- More on bounded independence plus noise: pseudorandom generators for read-once polynomials (Q5140841) (← links)
- (Q5140842) (← links)
- Quantum Authentication and Encryption with Key Recycling (Q5270366) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- Optimal Coin Flipping (Q5418975) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q5501933) (← links)
- Perfect $L_p$ Sampling in a Data Stream (Q5858643) (← links)
- (Q5875519) (← links)
- Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
