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

具保護(匿名)傳送者的可否認驗證協定

馬瑞澤

Published Jan 1, 2008• 0 citations
Publisher

Abstract

A deniable authentication protocol should satisfy the property that only the intended receiver authenticates the sender’s identity of received messages. This property is called authentication property. On the other hand, the intended receiver cannot prove the sender’s identity to the third party. The second property is called deniability property. To satisfy deniability property, in most deniable authentication protocols, the receiver is able to forge/modify the received message from the sender. Since the received data is forgeable by the receiver, the sender easily denies that he/she sent the data. Although the sent message is deniable for the sender, the sender still has no evidence to prove that he/she sent the message to prevent the receiver’s circumvention. In this propose, a new property, sender protection, is proposed for the deniable authentication protocol. In a deniable authentication protocol with sender protection, although the sent message is still forgeable by the receiver, the sender can provide an evidence to prove that whether or not the message is really sent from him/her. To protect senders more completely, it is better that the sender is anonymous in a deniable authentication protocol. Therefore, another goal of our research is to design a deniable authentication protocols with anonymous and protected sender.

DOI
10.6846/tku.2008.00419

Related papers

A New Deniable Authentication Protocol with Anonymous Fair Protections

Shin‐Jia Hwang, Chien-Hung Chao

Intended receiver and deniability properties are two basic properties satisfied by deniable authentication protocols. Recently, a deniable authentication protocol with sender protection is proposed to protect the right of the real sender. In other words, the sender can prove that he/she really sent the message to guard against circumvention by some receivers. However, the honest receiver still suffers the circumventing risk due to the senders' deniability. If the sender sent a deniable authenticated message to the innocent receiver and claimed that the message was generated by receivers. Then the receiver has nothing to convince the others that he/she is innocent. To provide fair protection and anonymity both for senders and receivers, a new deniable authentication protocol with anonymous fair protection is proposed.

•May 27, 2010•0 citations

An efficient non-interactive deniable authentication protocol with anonymous sender protection

Shin‐Jia Hwang, Chien-Hung Chao

Deniable authentication protocols satisfy two basic properties: Deniability and the specifiable receiver properties. However, the deniability also damages the sender right. To protect senders, Hwang and Ma first proposed deniable authentication with anonymous sender protection. The sender’s anonymity is also used to protect the sender’s privacy. To reduce the computation cost, an efficient deniable authentication protocol is proposed. Our new protocol not only achieves the two properties but also provides the protection of sender and receiver to keep the privacy of the sender and receiver. Though the sent message is forgeable by receivers, but the sender can provide evidence to prove the message was really sent by him/her. Due to the efficient performance, our protocol is more practical than the other protocols in the real world.

Journal of Discrete Mathematical Sciences and Cryptography•Jun 1, 2010•7 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

Security Analysis of a Suite of Deniable Authentication Protocols

Haibo Tian, Xiaofeng Chen, Baodian Wei +1 more

A deniable authentication protocol allows a sender to transfer an authenticated message to a receiver, and the receiver cannot prove to a third party about the source of the message. In 2006, Zhu et al. analyzed deniable authentication protocols proposed by Deng et al. in 2001, which were based on a protocol proposed by Aumann et al. in 1998. In this paper, we show that the modified protocols by Zhu et al. suffer from a Byzantine attack when two sessions run concurrently. We also suggest methods to solve the problem.

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

Fully Deniable Message Authentication Protocols Preserving Confidentiality

Lein Harn, Chiou‐Yng Lee, C. Lin +1 more

Although the objective of secure communication can be achieved by using cryptographic tools, the undeniability that results from cryptographic properties may create a potential threat to the sender of the message. Unfortunately, most existing deniable protocols only provide 1-out-of-2 deniability. When both parties (the sender and the receiver) are allowed to deny generating the message, a dispute might occur between these two parties. The 1-out-of-2 deniable protocol can result in an unfair resolution of the dispute. Therefore, we propose a new model of deniability, called 1-out-of-∞ deniability, that can provide full deniability. The 1-out-of-∞ deniability protocol allows the originator of the message to deny that he or she generated the message, since there are an infinite number of possible message generators; at the same time, all transmitted messages can be protected and authenticated between the sender and the intended receiver. Our design can be implemented by using any public-key cryptography technique. We also analyze the correctness of the proposed protocols based on logical rules, and two practical examples are given to illustrate our design.

The Computer Journal•Aug 23, 2011•8 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
A deniable authentication protocol should satisfy the property that only the intended receiver authenticates the sender’s identity of received messages. This property is called authentication property. On the other hand, the intended receiver cannot prove the sender’s identity to the third party. The second property is called deniability property. To satisfy deniability property, in most deniable authentication protocols, the receiver is able to forge/modify the received message from the sender. Since the received data is forgeable by the receiver, the sender easily denies that he/she sent the data. Although the sent message is deniable for the sender, the sender still has no evidence to prove that he/she sent the message to prevent the receiver’s circumvention. In this propose, a new property, sender protection, is proposed for the deniable authentication protocol. In a deniable authentication protocol with sender protection, although the sent message is still forgeable by the receiver, the sender can provide an evidence to prove that whether or not the message is really sent from him/her. To protect senders more completely, it is better that the sender is anonymous in a deniable authentication protocol. Therefore, another goal of our research is to design a deniable authentication protocols with anonymous and protected sender.
Intended receiver and deniability properties are two basic properties satisfied by deniable authentication protocols. Recently, a deniable authentication protocol with sender protection is proposed to protect the right of the real sender. In other words, the sender can prove that he/she really sent the message to guard against circumvention by some receivers. However, the honest receiver still suffers the circumventing risk due to the senders' deniability. If the sender sent a deniable authenticated message to the innocent receiver and claimed that the message was generated by receivers. Then the receiver has nothing to convince the others that he/she is innocent. To provide fair protection and anonymity both for senders and receivers, a new deniable authentication protocol with anonymous fair protection is proposed.
Deniable authentication protocols satisfy two basic properties: Deniability and the specifiable receiver properties. However, the deniability also damages the sender right. To protect senders, Hwang and Ma first proposed deniable authentication with anonymous sender protection. The sender’s anonymity is also used to protect the sender’s privacy. To reduce the computation cost, an efficient deniable authentication protocol is proposed. Our new protocol not only achieves the two properties but also provides the protection of sender and receiver to keep the privacy of the sender and receiver. Though the sent message is forgeable by receivers, but the sender can provide evidence to prove the message was really sent by him/her. Due to the efficient performance, our protocol is more practical than the other protocols in the real world.
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 allows a sender to transfer an authenticated message to a receiver, and the receiver cannot prove to a third party about the source of the message. In 2006, Zhu et al. analyzed deniable authentication protocols proposed by Deng et al. in 2001, which were based on a protocol proposed by Aumann et al. in 1998. In this paper, we show that the modified protocols by Zhu et al. suffer from a Byzantine attack when two sessions run concurrently. We also suggest methods to solve the problem.
Although the objective of secure communication can be achieved by using cryptographic tools, the undeniability that results from cryptographic properties may create a potential threat to the sender of the message. Unfortunately, most existing deniable protocols only provide 1-out-of-2 deniability. When both parties (the sender and the receiver) are allowed to deny generating the message, a dispute might occur between these two parties. The 1-out-of-2 deniable protocol can result in an unfair resolution of the dispute. Therefore, we propose a new model of deniability, called 1-out-of-∞ deniability, that can provide full deniability. The 1-out-of-∞ deniability protocol allows the originator of the message to deny that he or she generated the message, since there are an infinite number of possible message generators; at the same time, all transmitted messages can be protected and authenticated between the sender and the intended receiver. Our design can be implemented by using any public-key cryptography technique. We also analyze the correctness of the proposed protocols based on logical rules, and two practical examples are given to illustrate our design.
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.