Extracting Randomness Using Few Independent Sources
From MaRDI portal
Recommendations
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Simulating independence
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Extractors with weak random seeds
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
Cited in
(40)- The sum-product theorem in Z_q with q arbitrary
- Improving the Hadamard extractor
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Sparse affine-invariant linear codes are locally testable
- Extracting randomness from extractor-dependent sources
- Extractors for small zero-fixing sources
- Non-malleability against polynomial tampering
- No time to hash: on super-efficient entropy accumulation
- Explicit two-source extractors and resilient functions
- Deterministic extractors for affine sources over large fields
- A product theorem in free groups.
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
- Extractors for a constant number of polynomially small MIN-entropy independent sources
- Deterministic extractors for additive sources (extended abstract)
- An introduction to randomness extractors
- Increasing the output length of zero-error dispersers
- Zero-fixing extractors for sub-logarithmic entropy
- From affine to two-source extractors via approximate duality
- Increasing the Output Length of Zero-Error Dispersers
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- How to subvert backdoored encryption: security against adversaries that decrypt all ciphertexts
- Optimal bounds for single-source Kolmogorov extractors
- An explicit two-source extractor with min-entropy rate near $4/9$
- Growth in groups: ideas and perspectives
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Extractors for sumset sources
- New results on sum-product type growth over fields
- Proved random numbers obtained from hardware devices
- From affine to two-source extractors via approximate duality
- Extracting Randomness via Repeated Condensing
- Deterministic extractors for small-space sources
- Extractors and lower bounds for locally samplable sources
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Extractors in Paley graphs: a random model
- Interactions of computational complexity theory and mathematics
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
- Testing sumsets is hard
This page was built for publication: Extracting Randomness Using Few Independent Sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757459)
