Long-term security and universal composability

DOI10.1007/s00145-010-9068-8zbMath1207.94060WikidataQ62038945 ScholiaQ62038945MaRDI QIDQ604632

Dominique Unruh, Jörn Müller-Quade

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00145-010-9068-8

zbMATH Keywords

zero-knowledge; universal composability; commitment schemes; long-term security

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

94A62: Authentication, digital signatures and secret sharing

Related Items

Long term confidentiality: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum disclosure proofs of knowledge
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Composition of secure multi-party protocols. A comprehensive study.
• Security and composition of multiparty cryptographic protocols
• The reactive simulatability (RSIM) framework for asynchronous systems
• Composable Security in the Bounded-Quantum-Storage Model
• Cryptography in the Bounded-Quantum-Storage Model
• Universally composable two-party and multi-party secure computation
• On the (Im-)Possibility of Extending Coin Toss
• Universally Composable Security with Global Setup
• Long-Term Security and Universal Composability
• Indistinguishability Amplification
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• On the Composition of Zero-Knowledge Proof Systems
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography