Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Fully Deniable Mutual Authentication Protocol Based on RSA Signature.

Xi Lin, Lin Sun

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

Abstract: Deniable authentication protocols allow a sender to authenticate a receiver, in a way that the receiver cannot convince a third party that such authentication (or any authentication) ever took place. In this study, we construct a fully deniable mutual authentication protocol based on RSA signature, and then a deniable authenticated key exchange protocol is constructed from the proposed protocol.

Related papers

A novel certificateless deniable authentication protocol.

Chunhua Jin, Chunxiang Xu, Xiaojun Zhang +2 more

Abstract: Deniable authenticated protocol is a new and attractive protocol compared to the traditional authentication protocol. It allows the appointed receiver to identify the source of a given message, but not to prove the identity of the sender to a third party even if the appointed receiver is willing to reveal its private key. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol, by combining deniable authentication protocol with certificateless cryptography. In addition, we prove its security in the random oracle model.

•Jan 1, 2013•0 citations

New approaches for deniable authentication

Mario Di Raimondo, Rosario Gennaro

Deniable Authentication protocols allow a Sender to authenticate a message for a Receiver, in a way that the Receiver cannot convince a third party that such authentication (or any authentication) ever took place.We present two new approaches to the problem of deniable authentication. The novelty of our schemes is that they do not require the use of CCA-secure encryption (all previous known solutions did), thus showing a different generic approach to the problem of deniable authentication. This new approach is practically relevant as it leads to more efficient protocols and security reductions.In the process we point out a subtle definitional issue for deniability. In particular we propose the notion of forward deniability, which requires that the authentications remain deniable even if the Sender wants to later prove that she authenticated a message. We show that forward deniability is not implied by the original notion of deniability, by showing some deniable protocols which are not forward deniable. Our new proposals are forward deniable.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 7, 2005•69 citations

Deniable Authentication on the Internet.

Shaoquan Jiang

Abstract. Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, we first formalize a natural notion of deniable security and naturally extend the basic authenticator theorem by Bellare et al. [2] to the setting of deniable authentication. Of independent interest, this extension is achieved by defining a deniable MT-authenticator via a game. This game is essentially borrowed from the notion of universal composition [8] although we do not assume any result or background about it. Then we construct two deniable MT-authenticators: uncontrollable random oracle based and the PKI based, both of which are just 3-round protocols. The second construction assumes the receiver owns a secret key. Such a setup assumption is very popular in the real world. (Without this assumption), all the previous protocols do not have a widely satisfiable performance when applied in the Internet-like environment. Finally, as our application, we obtain key exchange protocols that is deniably secure in the real world. 1

•Jan 1, 2007•0 citations

Universal Encrypted Deniable Authentication Protocol.

Zhenfu Cao

The notion of deniable authentication protocol was introduced in 1998 by Dwork et al. [11] and Aumann and Rabin [1, 2] independently. As a new cryptographic authentication protocol, a deniable authentication protocol enables an intended receiver to identify the source of a given message without being able to prove the identity of the sender to a third party. Over the past years, many deniable authentication protocols have been proposed. In this paper, we would like to present a universal encrypted deniable authentication protocol from any public key encryption scheme. Provided that the public key encryption scheme is secure, a secure deniable authentication protocol can be directly derived.

International journal of network security•Jan 1, 2009•3 citations

An efficient deniable authentication protocol

Hui‐Feng Huang, Chin‐Chen Chang

The aim of deniable authenticated protocol allows the receiver to identity the source of a given message but not prove the identity of the sender to a third party. In this article, we propose a new non-interactive deniable authenticated protocol based on Diffie-Hellman key distribution protocol. It has lower communication costs and computational complexity than previously proposed schemes.

International Conference on Cyberworlds (CW)•Jan 1, 2005•1 citation

A Simple Deniable Authentication Protocol Based on Quantum Key Distribution

Chenhui Jin, Zhiyong Li, Su-hua LIAO

A deniable authentication protocol enables a receiver to identify the true source of given message, but not to prove the identity of the sender to a third party.This property is very useful for providing secure negotiation over the Internet.Recently, Shi et al. proposed a quantum deniable authentication protocol based on the property of unitary transformation and quantum one-way function.A trusted center (TC) is introduced in their protocol, and a much amount of quantum resources, such as entanglement, quantum memory and quantum one-way function, are required.In this paper, a deniable authentication protocol without a trust center is proposed based on the quantum key distribution (QKD).In the presented protocol, the QKD is used firstly to share a secret key between the sender and the receiver.Then, the shared key is used to identify the true source of sender's message by the receiver.Finally, the simulation based proof shows that the receiver cannot prove the identity of the sender to any third party.

International Conference on Computer Networks and Communication Technology (CNCT)•Jan 1, 2017•1 citation
Abstract: Deniable authentication protocols allow a sender to authenticate a receiver, in a way that the receiver cannot convince a third party that such authentication (or any authentication) ever took place. In this study, we construct a fully deniable mutual authentication protocol based on RSA signature, and then a deniable authenticated key exchange protocol is constructed from the proposed protocol.
Abstract: Deniable authenticated protocol is a new and attractive protocol compared to the traditional authentication protocol. It allows the appointed receiver to identify the source of a given message, but not to prove the identity of the sender to a third party even if the appointed receiver is willing to reveal its private key. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol, by combining deniable authentication protocol with certificateless cryptography. In addition, we prove its security in the random oracle model.
Deniable Authentication protocols allow a Sender to authenticate a message for a Receiver, in a way that the Receiver cannot convince a third party that such authentication (or any authentication) ever took place.We present two new approaches to the problem of deniable authentication. The novelty of our schemes is that they do not require the use of CCA-secure encryption (all previous known solutions did), thus showing a different generic approach to the problem of deniable authentication. This new approach is practically relevant as it leads to more efficient protocols and security reductions.In the process we point out a subtle definitional issue for deniability. In particular we propose the notion of forward deniability, which requires that the authentications remain deniable even if the Sender wants to later prove that she authenticated a message. We show that forward deniability is not implied by the original notion of deniability, by showing some deniable protocols which are not forward deniable. Our new proposals are forward deniable.
Abstract. Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, we first formalize a natural notion of deniable security and naturally extend the basic authenticator theorem by Bellare et al. [2] to the setting of deniable authentication. Of independent interest, this extension is achieved by defining a deniable MT-authenticator via a game. This game is essentially borrowed from the notion of universal composition [8] although we do not assume any result or background about it. Then we construct two deniable MT-authenticators: uncontrollable random oracle based and the PKI based, both of which are just 3-round protocols. The second construction assumes the receiver owns a secret key. Such a setup assumption is very popular in the real world. (Without this assumption), all the previous protocols do not have a widely satisfiable performance when applied in the Internet-like environment. Finally, as our application, we obtain key exchange protocols that is deniably secure in the real world. 1
The notion of deniable authentication protocol was introduced in 1998 by Dwork et al. [11] and Aumann and Rabin [1, 2] independently. As a new cryptographic authentication protocol, a deniable authentication protocol enables an intended receiver to identify the source of a given message without being able to prove the identity of the sender to a third party. Over the past years, many deniable authentication protocols have been proposed. In this paper, we would like to present a universal encrypted deniable authentication protocol from any public key encryption scheme. Provided that the public key encryption scheme is secure, a secure deniable authentication protocol can be directly derived.
A deniable authentication protocol enables a receiver to identify the true source of given message, but not to prove the identity of the sender to a third party.This property is very useful for providing secure negotiation over the Internet.Recently, Shi et al. proposed a quantum deniable authentication protocol based on the property of unitary transformation and quantum one-way function.A trusted center (TC) is introduced in their protocol, and a much amount of quantum resources, such as entanglement, quantum memory and quantum one-way function, are required.In this paper, a deniable authentication protocol without a trust center is proposed based on the quantum key distribution (QKD).In the presented protocol, the QKD is used firstly to share a secret key between the sender and the receiver.Then, the shared key is used to identify the true source of sender's message by the receiver.Finally, the simulation based proof shows that the receiver cannot prove the identity of the sender to any third party.