Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
From MaRDI portal
Publication:3183574
DOI10.1007/978-3-642-03356-8_21zbMath1252.94086MaRDI QIDQ3183574
Ueli M. Maurer, Stefano Tessaro
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_21
94A60: Cryptography
Related Items
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch, The Iterated Random Permutation Problem with Applications to Cascade Encryption