Explicit two-source extractors and resilient functions
From MaRDI portal
Publication:2320598
DOI10.4007/annals.2019.189.3.1zbMath1419.05109OpenAlexW2945571052MaRDI QIDQ2320598
Eshan Chattopadhyay, David Zuckerman
Publication date: 23 August 2019
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4007/annals.2019.189.3.1
Related Items
Extractors: low entropy requirements colliding with non-malleability ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Extractor Lower Bounds, Revisited ⋮ Unnamed Item ⋮ Lower bounds for matrix factorization ⋮ How to extract useful randomness from unreliable sources ⋮ Non-malleability against polynomial tampering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing Ramsey graphs from Boolean function representations
- The influence of large coalitions
- Almost \(k\)-wise independence versus \(k\)-wise independence
- Generating quasi-random sequences from semi-random sources
- Expanders, randomness, or time versus space
- A useful elementary correlation inequality
- Intersection theorems with geometric consequences
- The Shannon capacity of a union
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Randomness is linear in space
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Low rank co-diagonal matrices and Ramsey graphs
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- How to get more mileage from randomness extractors
- Extractors for Three Uneven-Length Sources
- Polylogarithmic independence fools AC 0 circuits
- Extractors
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Poisson approximation for large deviations
- Explicit Resilient Functions Matching Ajtai-Linial
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Towards optimal two-source extractors and Ramsey graphs
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Computational Complexity
- Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
- Non-malleable extractors and codes, with their many tampered extensions
- Extractors for sumset sources
- Distributed Computing
- Design extractors, non-malleable condensers and privacy amplification
- Extractors and pseudorandom generators
- Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
- Extractors for Circuit Sources
- Privacy Amplification and Nonmalleable Extractors Via Character Sums
- New independent source extractors with exponential improvement
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extracting Randomness Using Few Independent Sources
- Some remarks on the theory of graphs
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Simulating independence
- Extracting all the randomness and reducing the error in Trevisan's extractors
