scientific article; zbMATH DE number 7250143

DOI10.4230/LIPICS.CCC.2018.3MaRDI QIDQ5121891zbMATH OpenFDO

Authors Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Amnon Ta-Shma, Xin Li

Publication date 22 September 2020

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2018.3

zbMATH Keywords

explicit constructionsnon-malleable extractorspseudorandomnesstwo-source extractors

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorics in computer science (68R05)

Recommendations

• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• Low error efficient computational extractors in the CRS model
• Explicit two-source extractors and resilient functions
• Explicit two-source extractors and resilient functions
• Improved non-malleable extractors, non-malleable codes and independent source extractors

Cites work

• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
• A note on constructive methods for ramsey numbers
• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Explicit Resilient Functions Matching Ajtai-Linial
• Explicit two-source extractors and resilient functions
• Extractors with weak random seeds
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• Improved non-malleable extractors, non-malleable codes and independent source extractors
• Intersection theorems with geometric consequences
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Local correlation breakers and applications to three-source extractors and mergers
• Low rank co-diagonal matrices and Ramsey graphs
• Lower bounds for some Ramsey numbers
• MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
• Non-malleable extractors and codes, with their many tampered extensions
• Non-malleable extractors and symmetric key cryptography from weak secrets
• Non-malleable extractors: new tools and improved constructions
• Nonmalleable extractors with short seeds and applications to privacy amplification
• Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
• The dichromatic number of a digraph
• The Shannon capacity of a union
• Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Cited in

(6)

• How to extract useful randomness from unreliable sources
• Improved computational extractors and their applications
• scientific article; zbMATH DE number 6789272 (Why is no real title available?)
• scientific article; zbMATH DE number 7650110 (Why is no real title available?)
• Extractors for sum of two sources
• Extractors: low entropy requirements colliding with non-malleability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121891)