Lower bounds and impossibility results for concurrent self composition

DOI10.1007/s00145-007-9015-5zbMath1143.94012OpenAlexW2087140440MaRDI QIDQ2425531

Yehuda Lindell

Publication date: 6 May 2008

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-007-9015-5

zbMATH Keywords

secure computationprotocol composition

Mathematics Subject Classification ID

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

Related Items (5)

Concurrent Secure Computation via Non-Black Box Simulation ⋮ Cryptography Using Captcha Puzzles ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composition of secure multi-party protocols. A comprehensive study.
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• Universally composable two-party and multi-party secure computation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Bounded-concurrent secure two-party computation without setup assumptions
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Foundations of Cryptography
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds

This page was built for publication: Lower bounds and impossibility results for concurrent self composition