The following pages link to Randomness is linear in space (Q1915503):
Displaying 50 items.
- Leakage-resilient cryptography from minimal assumptions (Q315546) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Smooth projective hashing and two-message oblivious transfer (Q421036) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- The communication complexity of addition (Q519955) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Better short-seed quantum-proof extractors (Q764353) (← links)
- Robustly reusable fuzzy extractor with imperfect randomness (Q831183) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Reproducible circularly secure bit encryption: applications and realizations (Q1698399) (← links)
- Quasi chain rule for min-entropy (Q1707982) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- Reusable fuzzy extractor from the decisional Diffie-Hellman assumption (Q1791666) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- New approach to practical leakage-resilient public-key cryptography (Q2023806) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Reusable fuzzy extractors for low-entropy distributions (Q2032056) (← links)
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments (Q2044755) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Adaptive extractors and their application to leakage resilient secret sharing (Q2129011) (← links)
- No time to hash: on super-efficient entropy accumulation (Q2139648) (← links)
- A generic construction of fuzzy signature (Q2151284) (← links)
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience (Q2152060) (← links)
- Authentication in the bounded storage model (Q2170109) (← links)
- Privacy amplification from non-malleable codes (Q2179398) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Continuous leakage-resilient certificate-based encryption (Q2279532) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Prediction from partial information and hindsight, with application to circuit lower bounds (Q2311545) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- A modular framework for quantum-proof randomness extractors (Q2400201) (← links)
- Instantiability of RSA-OAEP under chosen-plaintext attack (Q2408591) (← 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)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy (Q2947523) (← links)
