Extractors and pseudorandom generators
From MaRDI portal
Publication:5441361
DOI10.1145/502090.502099zbMath1127.68403OpenAlexW1967175855MaRDI QIDQ5441361
Publication date: 11 February 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/502090.502099
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Random number generation in numerical analysis (65C10) Randomized algorithms (68W20)
Related Items (38)
On explicit constructions of designs ⋮ Expander-based cryptography meets natural proofs ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ Reconstructive dispersers and hitting set generators ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ A modular framework for quantum-proof randomness extractors ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ List-decoding Barnes-Wall lattices ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ Short leakage resilient and non-malleable secret sharing schemes ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Set-Codes with Small Intersections and Small Discrepancies ⋮ Cryptography from one-way communication: on completeness of finite channels ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Deterministic extractors for small-space sources ⋮ On uniformity and circuit lower bounds ⋮ An Introduction to Randomness Extractors ⋮ THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT ⋮ Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive derandomization ⋮ Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Extractors from Reed-Muller codes ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Pseudo-random generators for all hardnesses ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ The complexity of the matroid-greedoid partition problem ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Improved bounds for quantified derandomization of constant-depth circuits and polynomials ⋮ Better short-seed quantum-proof extractors ⋮ Explicit two-source extractors and resilient functions ⋮ Resource bounded symmetry of information revisited ⋮ Towards efficient LPN-based symmetric encryption
This page was built for publication: Extractors and pseudorandom generators
