Composition Implies Adaptive Security in Minicrypt

DOI10.1007/11761679_20MaRDI QIDQ3593104zbMATH OpenOpenAlexFDO

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

Recommendations

• Adaptive and composable non-committing encryptions
• Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
• Adaptive hardness and composable security in the plain model from standard assumptions
• Handling adaptive compromise for practical encryption schemes
• Improved non-committing encryption with applications to adaptively secure protocols
• Secure composition of cryptographic protocols. (Abstract)
• Minicrypt primitives with algebraic structure and applications
• Minicrypt primitives with algebraic structure and applications
• scientific article; zbMATH DE number 1418290
• Adaptively secure coin-flipping, revisited

Cites work

• A Mathematical Theory of Communication
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - EUROCRYPT 2004
• Composition Does Not Imply Adaptive Security
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 176554 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• New directions in cryptography
• On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
• Secret key agreement by public discussion from common information
• Theory of Cryptography
• Theory of Cryptography

Cited in

(10)

• From non-adaptive to adaptive pseudorandom functions
• Hardness-preserving reductions via cuckoo hashing
• Clever arbiters versus malicious adversaries. On the gap between known-input security and chosen-input security
• Adaptive hardness and composable security in the plain model from standard assumptions
• Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
• Near collision attack on the Grain v1 stream cipher
• Equivalence of uniform key agreement and composition insecurity
• Luby-Rackoff Ciphers from Weak Round Functions?
• Composition Does Not Imply Adaptive Security
• On the equivalence of uniform key agreement and sequential composition insecurity

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

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