Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma

DOI10.1007/978-3-642-19571-6_3zbMath1281.94058OpenAlexW1607318501MaRDI QIDQ3000530

Stefano Tessaro

Publication date: 19 May 2011

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_3

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (5)

The Iterated Random Permutation Problem with Applications to Cascade Encryption ⋮ Random oracles and non-uniformity ⋮ The Multi-user Security of Double Encryption ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Rounding in the rings

This page was built for publication: Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma