A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
From MaRDI portal
Publication:3408197
DOI10.1007/978-3-642-11799-2_15zbMath1274.94098MaRDI QIDQ3408197
Stefano Tessaro, Ueli M. Maurer
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_15
94A60: Cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient amplification of the security of weak pseudo-random function generators
- On Yao’s XOR-Lemma
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Key agreement from weak bit agreement
- Security Amplification for Interactive Cryptographic Primitives
- Indistinguishability Amplification
- Privacy Amplification by Public Discussion
- A Pseudorandom Generator from any One-way Function
- Probability Inequalities for Sums of Bounded Random Variables
- On the Power of the Randomized Iterate
- Deterministic extractors for small-space sources
- Theory of Cryptography