Composition Does Not Imply Adaptive Security

DOI10.1007/11535218_4MaRDI QIDQ5451018zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• Composition Implies Adaptive Security in Minicrypt
• Equivalence of uniform key agreement and composition insecurity
• Theory of Cryptography
• From non-adaptive to adaptive pseudorandom functions

Cited in

(13)

• From non-adaptive to adaptive pseudorandom functions
• Derandomized constructions of \(k\)-wise (almost) independent permutations
• Hardness-preserving reductions via cuckoo hashing
• Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
• Tweak-length extension for tweakable blockciphers
• Equivalence of uniform key agreement and composition insecurity
• Constructive cryptography -- a primer. (Abstract)
• Composition Implies Adaptive Security in Minicrypt
• Luby-Rackoff Ciphers from Weak Round Functions?
• Advances in Cryptology - EUROCRYPT 2004
• Theory of Cryptography
• Let attackers program ideal models: modularity and composability for adaptive compromise
• On the equivalence of uniform key agreement and sequential composition insecurity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451018)