Full and partial deniability for authentication schemes
From MaRDI portal
Recommendations
- A New Scheme for Deniable/Repudiable Authentication
- New approaches for deniable authentication
- Composability and On-Line Deniability of Authentication
- Bounds and characterizations of authentication/secrecy schemes
- An efficient entire chaos-based scheme for deniable authentication
- Deniable Authentication on the Internet
- Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
- Perfect and Essentially Perfect Authentication Schemes
- Private Mutual Authentication and Conditional Oblivious Transfer
Cites work
- scientific article; zbMATH DE number 1302854 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A non-interactive deniable authentication scheme based on designated verifier proofs
- A simple deniable authentication protocol based on the Diffie–Hellman algorithm
- A simple protocol for deniable authentication based on ElGamal cryptography
- Foundations of Cryptography
- Nonmalleable Cryptography
Cited in
(5)
This page was built for publication: Full and partial deniability for authentication schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352021)
