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

Journal of Xidian University

An undeniable cryptographic protocol for both thesender and the receiver

Jianzhong Zhang

Published Jan 1, 2004• 0 citations
OpenAlex

Abstract

We survey the state of non-repudiation cryptographic protocols, almost all of which have weaknesses. The paper proposes a perfect protocol which can be used to realize the strong fairness and non-repudiation of both parties even if the channels are not reliable. Usually the protocol only needs three interactions of participants and the transferring data remain confidential for others but the sender and the receiver, who are unknown to others. The Trusted Third Party(TTP) acts as a notary rather than a delivery and its bottleneck problem is solved completely. Finally the security of the protocol is analysed in detail.

Related papers

A Hybrid Cryptosystem-Based Non-Repudiation Protocol and Its Formal Analysis

Li Yan

A non-repudiation cryptographic protocol based on hybrid cryptosystem is proposed and it is a more perfect protocol.It can realize the true fairness and non-repudiation of both parties even the channels are unreliable and insecure.Usually the protocol only needs three interactions of participants and the transferring data keep confidential for others except for the sender and the receiver,whose transactions are protected.The Trusted Third Party(TTP) performs evidences verification,generation and publication and its bottleneck problem is solved completely.Finally,we give its formal analysis and prove the protocol's fairness,correctness and security.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2004•0 citations

Undeniable Cryptographic Protocol for Both Sender and Receiver and Its Applications

Xianxian Li, Jinpeng Huai

In data communications, digital signature schemes have been used to ensure non repudiation of sending data and the integrality of data, and non repudiation of receiving data is also very important in the secure communication. In the past years, this kind of cryptographic protocols was mainly implemented by the intervention of the trusted third party in transmission and encryption of data, thus the dependability and security of the trusted third party was a bottleneck in these secure systems. To solve this problem, an undeniable cryptographic protocol for both sender and receiver is proposed. It is more efficient. Finally, its applications in electric mail are discussed.

Beijing Hangkong Hangtian Daxue xuebao•Feb 28, 2001•0 citations

Analysis and Improvement of a Mutually Undeniable Cryptographic Protocol

Yanping Li

Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in e-commerce. Non-repudiation protocol is a special network protocol which provides non-repudiation service. Because of the importance of non-repudiation to electronic commerce activities and the fact that non-repudiation protocol is relatively few, this paper adopts the modern cryptographic algorithms and techniques and designs a mutually undeniable cryptographic protocol. Analyses show that the improved protocol avoids the trusted third party being the bottleneck problem, and also realizes the confidentiality of transferring data, and the fairness and non-repudiation of the sender and the receiver.

Journal of Huaihai Institute of Technology•Jan 1, 2006•0 citations

A New Mutually Undeniable Cryptographic Protocol and Its Formal Analysis

Jiwen Zeng

Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in ecommerce.Non-repudiation protocol is a special network protocol which provides non-repudiation service.But real non-repudiation protocol is relatively few.In this paper,a new mutually undeniable cryptographic protocol was proposed.The protocol not only prevents some possible types of attack(for example,Middle-in-Attack,Replay attack,Impersonation Attack et al.),but also avoids the trusted third party being the bottleneck problem,and ensures the confidentiality and the integrity of transferring data,real non-repudiation of the sender and the receiver.The new protocol is of mutually undeniable property.

Journal of Xiamen University•Jan 1, 2008•0 citations

Generic non-repudiation protocols supporting transparent off-line TTP

Guilin Wang

A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet. That is, at the end of any execution instance of such a protocol, either both parties obtain their expected items or neither party does . In this paper, we first argue that it is really meaningful in practice to exploit generic fair non-repudiation protocols with transparent off-line trusted third party (TTP). Namely, in those protocols, each involved party could use any secure digital signature algorithm to produce non-repudiation evidences; and the issued evidences are the same regardless of whether the TTP is involved or not. Then, we present such a fair non-repudiation protocol to overcome some limitations and shortcomings in previous schemes. Technical discussions are provided to show that our protocol is not only secure but also the most efficient solution, compared with existing non-repudiation protocols. In addition, some potential extensions are also pointed out.

Journal of Computer Security•Nov 8, 2006•29 citations

A fair non-repudiation protocol

Jianying Zhou, Dieter Gollmann

A fair non-repudiation protocol should not give the sender of a message an advantage over the receiver, or vice versa. We present a fair non-repudiation protocol that requires a trusted third party but attempts to minimize its involvement in the execution of the protocol. We draw particular attention to the nonstandard use of encryption in our protocol and discuss some aspects of its formal verification.

IEEE Symposium on Security and Privacy (S&P)•Dec 23, 2002•111 citations
We survey the state of non-repudiation cryptographic protocols, almost all of which have weaknesses. The paper proposes a perfect protocol which can be used to realize the strong fairness and non-repudiation of both parties even if the channels are not reliable. Usually the protocol only needs three interactions of participants and the transferring data remain confidential for others but the sender and the receiver, who are unknown to others. The Trusted Third Party(TTP) acts as a notary rather than a delivery and its bottleneck problem is solved completely. Finally the security of the protocol is analysed in detail.
A non-repudiation cryptographic protocol based on hybrid cryptosystem is proposed and it is a more perfect protocol.It can realize the true fairness and non-repudiation of both parties even the channels are unreliable and insecure.Usually the protocol only needs three interactions of participants and the transferring data keep confidential for others except for the sender and the receiver,whose transactions are protected.The Trusted Third Party(TTP) performs evidences verification,generation and publication and its bottleneck problem is solved completely.Finally,we give its formal analysis and prove the protocol's fairness,correctness and security.
In data communications, digital signature schemes have been used to ensure non repudiation of sending data and the integrality of data, and non repudiation of receiving data is also very important in the secure communication. In the past years, this kind of cryptographic protocols was mainly implemented by the intervention of the trusted third party in transmission and encryption of data, thus the dependability and security of the trusted third party was a bottleneck in these secure systems. To solve this problem, an undeniable cryptographic protocol for both sender and receiver is proposed. It is more efficient. Finally, its applications in electric mail are discussed.
Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in e-commerce. Non-repudiation protocol is a special network protocol which provides non-repudiation service. Because of the importance of non-repudiation to electronic commerce activities and the fact that non-repudiation protocol is relatively few, this paper adopts the modern cryptographic algorithms and techniques and designs a mutually undeniable cryptographic protocol. Analyses show that the improved protocol avoids the trusted third party being the bottleneck problem, and also realizes the confidentiality of transferring data, and the fairness and non-repudiation of the sender and the receiver.
Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in ecommerce.Non-repudiation protocol is a special network protocol which provides non-repudiation service.But real non-repudiation protocol is relatively few.In this paper,a new mutually undeniable cryptographic protocol was proposed.The protocol not only prevents some possible types of attack(for example,Middle-in-Attack,Replay attack,Impersonation Attack et al.),but also avoids the trusted third party being the bottleneck problem,and ensures the confidentiality and the integrity of transferring data,real non-repudiation of the sender and the receiver.The new protocol is of mutually undeniable property.
A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet. That is, at the end of any execution instance of such a protocol, either both parties obtain their expected items or neither party does . In this paper, we first argue that it is really meaningful in practice to exploit generic fair non-repudiation protocols with transparent off-line trusted third party (TTP). Namely, in those protocols, each involved party could use any secure digital signature algorithm to produce non-repudiation evidences; and the issued evidences are the same regardless of whether the TTP is involved or not. Then, we present such a fair non-repudiation protocol to overcome some limitations and shortcomings in previous schemes. Technical discussions are provided to show that our protocol is not only secure but also the most efficient solution, compared with existing non-repudiation protocols. In addition, some potential extensions are also pointed out.