New approaches for deniable authentication

DOI10.1007/s00145-009-9044-3zbMath1178.94187OpenAlexW1983765476MaRDI QIDQ1037236

Rosario Gennaro, Mario Di Raimondo

Publication date: 13 November 2009

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

Full work available at URL: https://doi.org/10.1007/s00145-009-9044-3

zbMATH Keywords

zero knowledgedeniable authentication

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

A new framework for deniable secure key exchange ⋮ Explainable arguments ⋮ A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks ⋮ Timed encryption with application to deniable key exchange ⋮ A new approach for UC security concurrent deniable authentication ⋮ A non-interactive deniable authentication scheme based on designated verifier proofs ⋮ Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs ⋮ Generic transformation from broadcast encryption to round-optimal deniable ring authentication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure
• Probabilistic encryption
• Minimum disclosure proofs of knowledge
• Universal classes of hash functions
• How to construct constant-round zero-knowledge proof systems for NP
• Designated Verifier Proofs and Their Applications
• New Generation of Secure and Practical RSA-Based Signatures
• Non-interactive and reusable non-malleable commitment schemes
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Nonmalleable Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Concurrent zero-knowledge

This page was built for publication: New approaches for deniable authentication