Extractors and pseudorandom generators
From MaRDI portal
Recommendations
- Construction of extractors using pseudo-random generators (extended abstract)
- Simple extractors for all min-entropies and a new pseudorandom generator
- Automata, Languages and Programming
- Simple extractors via constructions of cryptographic pseudo-random generators
- Extracting all the randomness and reducing the error in Trevisan's extractors
Cited in
(76)- The complexity of the matroid-greedoid partition problem
- Non-interactive timestamping in the bounded-storage model
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Towards efficient LPN-based symmetric encryption
- On explicit constructions of designs
- Expander-based cryptography meets natural proofs
- Simple extractors via constructions of cryptographic pseudo-random generators
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials
- Explicit two-source extractors and resilient functions
- Reconstructive dispersers and hitting set generators
- A modular framework for quantum-proof randomness extractors
- List-decoding Barnes-Wall lattices
- Extractors from Reed-Muller codes
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- Resource bounded symmetry of information revisited
- Cryptography from one-way communication: on completeness of finite channels
- Construction of extractors using pseudo-random generators (extended abstract)
- Pseudorandom generators without the XOR lemma (extended abstract)
- Computational extractors and pseudorandomness
- Space-bounded Kolmogorov extractors
- Randomness extractors -- applications and constructions
- Sparse extractor families for all the entropy
- An introduction to randomness extractors
- The unified theory of pseudorandomness
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- Extractors and pseudo-random generators with optimal seed length
- How to get more mileage from randomness extractors
- Simple extractors for all min-entropies and a new pseudorandom generator
- Extractors with weak random seeds
- Extractors Using Hardness Amplification
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- Dimension, pseudorandomness and extraction of pseudorandomness
- scientific article; zbMATH DE number 6963652 (Why is no real title available?)
- scientific article; zbMATH DE number 1833397 (Why is no real title available?)
- scientific article; zbMATH DE number 1833398 (Why is no real title available?)
- On uniformity and circuit lower bounds
- Randomness extraction in \(\mathsf{AC}^0\) and with small locality
- Quantified Derandomization: How to Find Water in the Ocean
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
- Secret sharing with binary shares
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Set-codes with small intersections and small discrepancies
- Local list recovery of high-rate tensor codes and applications
- Nonmalleable extractors and codes, with their many tampered extensions
- Dimension, Pseudorandomness and Extraction of Pseudorandomness
- Extracting Computational Entropy and Learning Noisy Linear Functions
- On Obtaining Pseudorandomness from Error-Correcting Codes
- THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
- Automata, Languages and Programming
- Two-source randomness extractors for elliptic curves for authenticated key exchange
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Deterministic extractors for small-space sources
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Pseudo-random generators for all hardnesses
- 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
- New concepts and construction of quantum random number generators
- Certified randomness from quantum supremacy
- Nearly optimal pseudorandomness from hardness
- Bicorn: an optimistically efficient distributed randomness beacon
- Deterministic sparse Fourier transform with an _ guarantee
- Seed-protecting extractors
- Hardness along the boundary: towards one-way functions from the worst-case hardness of time-bounded Kolmogorov complexity
- Two-sources randomness extractors in finite fields and in elliptic curves
- Randomness extractors in AC^0 and NC^1: optimal up to constant factors
- The complexity of explicit constructions
- Regularization of low error PCPs and an application to MCSP
- Pseudo-random number generation with -encoders
- Extracting Kolmogorov complexity with applications to dimension zero-one laws
- Total functions in the polynomial hierarchy
- Bit-fixing extractors for almost-logarithmic entropy
- Better short-seed quantum-proof extractors
- Reducing the seed length in the Nisan-Wigderson generator
- Exposure-resilient extractors and the derandomization of probabilistic sublinear time
This page was built for publication: Extractors and pseudorandom generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441361)
