2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
From MaRDI portal
Publication:5171224
DOI10.1109/FOCS.2009.61zbMath1292.94088MaRDI QIDQ5171224
No author found.
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Cryptography (94A60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (12)
Improved computational extractors and their applications ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ On the impossibility of cryptography with tamperable randomness ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ An Introduction to Randomness Extractors ⋮ Leakage-resilient coin tossing ⋮ Unnamed Item ⋮ Low error efficient computational extractors in the CRS model ⋮ Multi-source non-malleable extractors and applications ⋮ Leakage-Resilient Coin Tossing ⋮ Explicit two-source extractors and resilient functions ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
This page was built for publication: 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
