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

Probabilistic Non-Repudiation without Trusted Third Party

Olivier Markowitch, Yves Roggeman

Published Sep 1, 1999• 111 citations
OpenAlex

Abstract

Abstract. We present a new theoretical generic protocol that offers non-repudiation services. We first go through the state of the art about non-repudiation. We will see that in order to achieve complete nonrepudiation during an information transfer a trusted third party is often needed (even playing a low weight role), obtaining an acknowledgement from the recipient being the current major problem. We aim to show the possibility of achieving fair non-repudiation services without the need of a third party. We will propose a concrete implementation inspired by this generic protocol. 1

Related papers

An efficient non-repudiation protocol

Jianying Zhou, Dieter Gollmann

Fairness may be a desirable property of a non-repudiation service. Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the workload of the trusted third party. In this paper, we present a variant of our fair non-repudiation protocol (1996), where the trusted third party is involved only in the case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.

IEEE Computer Security Foundations Workshop (CSFW)•Nov 22, 2002•151 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 New Fair Non-Repudiation Protocol with Off-Line Semi-Trusted Third Party

Cai Wang

Non repudiation and fairness turn out to be two important security properties of electronic commerce protocols.In this paper,based on a verifiable encryption with blind decryption,we present a new fair non repudiation protocol with off line semi trusted third party,so either transaction party can unilaterally bring a transaction to completion without losing fairness.This is the first non repudiation protocol with off line semi trusted third party.

Dianzi xuebao•Jan 1, 2002•0 citations

An undeniable cryptographic protocol for both thesender and the receiver

Jianzhong Zhang

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.

Journal of Xidian University•Jan 1, 2004•0 citations

Certified e-Mail Protocol with Verifiable Third Party

Macià Mut–Puigserver, Josep Lluís Ferrer Gomila, Llorenç Huguet Rotger

Certified e-mail is a particular case of fair exchange. TTPs play an important role in this kind of protocols and their reliability and security is a problem that needs to be addressed. In order to enhance the trust in non-repudiation services we propose TTPs that provide verifiable services, so users get evidence of the TTPs operations. In this paper we design a new certified e-mail protocol where the user confidence on what is happening when he invokes the TTP is enhanced.

IEEE Conference on Commerce and Enterprise Computing (CEC)•Apr 12, 2005•12 citations

A multi-party non-repudiation protocol with semi-trusted third party

Wang Caifen, Jianhua Ge, Xinjun Du +3 more

Multi-party exchange protocols are so widely used in electronic commerce that more and more attention is being paid to designing multi-party protocols or algorithms. Multi-party protocols with non-repudiation play an important role in data fair exchange in the Internet. In this paper, we present a new multi-party protocol with off-line semi-trusted third party (STTP). The protocol is very efficient, at most 5|R|message are broadcast.

IEEE Region 10 Conference (TENCON)•Mar 1, 2004•3 citations
Abstract. We present a new theoretical generic protocol that offers non-repudiation services. We first go through the state of the art about non-repudiation. We will see that in order to achieve complete nonrepudiation during an information transfer a trusted third party is often needed (even playing a low weight role), obtaining an acknowledgement from the recipient being the current major problem. We aim to show the possibility of achieving fair non-repudiation services without the need of a third party. We will propose a concrete implementation inspired by this generic protocol. 1
Fairness may be a desirable property of a non-repudiation service. Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the workload of the trusted third party. In this paper, we present a variant of our fair non-repudiation protocol (1996), where the trusted third party is involved only in the case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.
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.
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.