2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

DOI10.1109/FOCS.2009.61MaRDI QIDQ5171224zbMATH OpenFDO

Authors

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2009.61

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60)

Cited in

(13)

• On the impossibility of cryptography with tamperable randomness
• Low error efficient computational extractors in the CRS model
• Multi-source non-malleable extractors and applications
• Improved computational extractors and their applications
• Leakage-resilient coin tossing
• Explicit two-source extractors and resilient functions
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• An introduction to randomness extractors
• Leakage-Resilient Coin Tossing
• From affine to two-source extractors via approximate duality
• Non-malleable extractors and non-malleable codes: partially optimal constructions
• Nonmalleable extractors and codes, with their many tampered extensions
• Two-source and affine non-malleable extractors for small entropy

This page was built for publication: 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

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