Secure computation without authentication

DOI10.1007/s00145-010-9075-9zbMath1243.94024OpenAlexW2078110310MaRDI QIDQ656923

Ran Canetti, Boaz Barak, Yehuda Lindell, Tal Rabin, Rafael Pass

Publication date: 13 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00145-010-9075-9

zbMATH Keywords

securityauthenticationcryptographic protocolssecure multiparty computationnonmalleable commitmentspartially authenticated networkspassword-based authenticated key exchange

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Round-optimal password-based authenticated key exchange ⋮ When Are Fuzzy Extractors Possible?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining authenticated communication in the presence of break-ins
• 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
• Credential Authenticated Identification and Key Exchange
• Universally Composable Security with Global Setup
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• Nonmalleable Cryptography
• Foundations of Cryptography
• Detectable byzantine agreement secure against faulty majorities
• Universally Composable Password-Based Key Exchange
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: Secure computation without authentication