An introduction to randomness extractors
From MaRDI portal
Publication:3012907
Recommendations
Cites work
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 1097580 (Why is no real title available?)
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- A Chernoff Bound for Random Walks on Expander Graphs
- A sum-product estimate in finite fields, and applications
- Affine dispersers from subspace polynomials
- Affine extractors over prime fields
- Algorithmic Results in List Decoding
- Almost optimal dispersers
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Computational Complexity
- Cryptography and Coding
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Deterministic extractors for affine sources over large fields
- Deterministic extractors for small-space sources
- Dispersers for Affine Sources with Sub-polynomial Entropy
- Eigenvalues and expansion of regular graphs
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Expander graphs and their applications
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- Explicit OR-dispersers with polylogarithmic degree
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Extracting Randomness Using Few Independent Sources
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extracting randomness: A survey and new constructions
- Extractor Codes
- Extractors
- Extractors and pseudorandom generators
- Extractors and rank extractors for polynomial sources
- Extractors for Three Uneven-Length Sources
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- Extractors from Reed-Muller codes
- Extractors with weak random seeds
- From affine to two-source extractors via approximate duality
- Generating quasi-random sequences from semi-random sources
- Hardness vs randomness
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Intersection theorems with geometric consequences
- Iterating von Neumann's procedure for extracting random bits
- Lossless condensers, unbalanced expanders, and extractors
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- On the construction of affine extractors
- Pseudorandom Generators and Typically-Correct Derandomization
- Randomness conductors and constant-degree lossless expanders
- Randomness is linear in space
- Simple extractors for all min-entropies and a new pseudorandom generator
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- The Efficient Construction of an Unbiased Random Sequence
- The Shannon capacity of a union
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
Cited in
(27)- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Shannon entropy versus Renyi entropy from a cryptographic viewpoint
- Property testing lower bounds via a generalization of randomized parity decision trees
- From graphs to keyed quantum hash functions
- Paradigms for Unconditional Pseudorandom Generators
- Randomness extractors -- applications and constructions
- A better chain rule for HILL pseudoentropy -- beyond bounded leakage
- On extracting space-bounded Kolmogorov complexity
- Two-source randomness extractors for elliptic curves for authenticated key exchange
- scientific article; zbMATH DE number 2102396 (Why is no real title available?)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- scientific article; zbMATH DE number 2156273 (Why is no real title available?)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Improving \(3N\) circuit complexity lower bounds
- Zero-fixing extractors for sub-logarithmic entropy
- Extractors with weak random seeds
- The complexity of differential privacy
- Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure
- Efficient and Provable White-Box Primitives
- Randomness extraction in computability theory
- How to get more mileage from randomness extractors
- Code generator matrices as RNG conditioners
- scientific article; zbMATH DE number 6963652 (Why is no real title available?)
- Deterministic extraction from weak random sources.
- Algebras of probability distributions on finite sets
- Clone-induced approximation algebras of Bernoulli distributions
This page was built for publication: An introduction to randomness extractors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012907)
