Secure computation without authentication
DOI10.1007/S00145-010-9075-9zbMATH Open1243.94024OpenAlexW2078110310MaRDI QIDQ656923FDOQ656923
Authors: Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin 
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
Recommendations
authenticationsecuritycryptographic protocolssecure multiparty computationnonmalleable commitmentspartially authenticated networkspassword-based authenticated key exchange
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cites Work
- Security and composition of multiparty cryptographic protocols
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Nonmalleable Cryptography
- Foundations of Cryptography
- Title not available (Why is that?)
- The Knowledge Complexity of Interactive Proof Systems
- Universally Composable Password-Based Key Exchange
- Universally composable two-party and multi-party secure computation
- Universally Composable Security with Global Setup
- Title not available (Why is that?)
- Theory of Cryptography
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Detectable Byzantine agreement secure against faulty majorities
- Maintaining authenticated communication in the presence of break-ins
- 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
- Title not available (Why is that?)
- Theory of Cryptography
Cited In (3)
This page was built for publication: Secure computation without authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656923)
