Composition Does Not Imply Adaptive Security

DOI10.1007/11535218_4zbMath1143.94352OpenAlexW2166657385MaRDI QIDQ5451018

Krzysztof Pietrzak

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Tweak-Length Extension for Tweakable Blockciphers ⋮ Derandomized constructions of \(k\)-wise (almost) independent permutations ⋮ Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Composition Implies Adaptive Security in Minicrypt ⋮ Luby-Rackoff Ciphers from Weak Round Functions? ⋮ From non-adaptive to adaptive pseudorandom functions

This page was built for publication: Composition Does Not Imply Adaptive Security