Secure computation without authentication
From MaRDI portal
Publication:656923
Recommendations
Cites work
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1842504 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - CRYPTO 2003
- 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
- Detectable Byzantine agreement secure against faulty majorities
- Foundations of Cryptography
- Maintaining authenticated communication in the presence of break-ins
- Nonmalleable Cryptography
- Security and composition of multiparty cryptographic protocols
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of Cryptography
- Universally Composable Password-Based Key Exchange
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
Cited in
(4)
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)