Composition Implies Adaptive Security in Minicrypt

DOI10.1007/11761679_20zbMath1140.94367OpenAlexW1594300884MaRDI QIDQ3593104

Krzysztof Pietrzak

Publication date: 24 September 2007

Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11761679_20

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions ⋮ Near Collision Attack on the Grain v1 Stream Cipher ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Luby-Rackoff Ciphers from Weak Round Functions? ⋮ Clever Arbiters Versus Malicious Adversaries ⋮ From non-adaptive to adaptive pseudorandom functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Secret key agreement by public discussion from common information
• Advances in Cryptology - EUROCRYPT 2004
• Composition Does Not Imply Adaptive Security
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: Composition Implies Adaptive Security in Minicrypt