Explicit two-source extractors and resilient functions
From MaRDI portal
Recommendations
- Explicit two-source extractors and resilient functions
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Towards a Theory of Extractable Functions
- On extractors and exposure-resilient functions for sublogarithmic entropy
- Extractable Perfectly One-Way Functions
- Non-malleable codes from two-source extractors
- Explicit constructions of extractors and expanders
- Extractors and lower bounds for locally samplable sources
- Extractors and lower bounds for locally samplable sources
- On the existence of extractable one-way functions
Cited in
(42)- Extracting randomness from extractor-dependent sources
- Low error efficient computational extractors in the CRS model
- Multi-source non-malleable extractors and applications
- Extractors for small zero-fixing sources
- Non-malleable codes for bounded parallel-time tampering
- Improved computational extractors and their applications
- No time to hash: on super-efficient entropy accumulation
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Explicit two-source extractors and resilient functions
- Local correlation breakers and applications to three-source extractors and mergers
- From affine to two-source extractors via approximate duality
- A 2-Source Almost-Extractor for Linear Entropy
- Towards a Theory of Extractable Functions
- Induced subgraphs with many distinct degrees
- On extractors and exposure-resilient functions for sublogarithmic entropy
- Towards optimal two-source extractors and Ramsey graphs
- Large cliques and independent sets all over the place
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Optimal deterministic extractors for generalized Santha-Vazirani sources
- Randomness extraction in \(\mathsf{AC}^0\) and with small locality
- Sunflowers and quasi-sunflowers from randomness extractors
- Ramsey properties of algebraic graphs and hypergraphs
- 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
- Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions
- Near-optimal pseudorandom generators for constant-depth read-once formulas
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Lower bounds for matrix factorization
- scientific article; zbMATH DE number 7250143 (Why is no real title available?)
- An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
- Sampling lower bounds: Boolean average-case and permutations
- Counting rectangles and an improved restriction estimate for the paraboloid in F_p^3
- An explicit two-source extractor with min-entropy rate near $4/9$
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- The work of Mark Braverman
- Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
- Black-box non-interactive zero knowledge from vector trapdoor hash
- Spectral Pseudorandomness and the Road to Improved Clique Number Bounds for Paley Graphs
- Multi-source randomness extraction and generation in the random-oracle model
This page was built for publication: Explicit two-source extractors and resilient functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361870)
