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

IEEE Symposium on Security and Privacy (S&P)

A fair non-repudiation protocol

Jianying Zhou, Dieter Gollmann

Published Dec 23, 2002• 111 citations
Publisher

Abstract

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.

DOI
10.1109/secpri.1996.502669

Related papers

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

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

A FAIR MULTI-PARTY NON-REPUDIATION PROTOCOL

Deng Suo-yun

Non-repudiation is one of the most important premises to achieve electronic commerce while fairness is what people have been chasing during electronic transaction. Fair non-repudiation protocols resolve the question of non-repudiation during the course of transferring information in electronic commerce and make all communicating sides in equal positions. That is to say, the protocols are fair for all sides. In the present paper, a fair multi-party non-repudiation protocol based on a group encryption scheme is introduced. The flow of the protocol and its analysis are given in the paper. In the protocol, every side can not have advantages over other sides, because the advantages can result in great loss of other sides. The method that how to solve the dissension with this protocol is also given in the present paper. A trusted third party is used to generate non-repudiation evidence. With this method the number of exchanged messages is small. So this protocol can achieve non-repudiation service in an efficient and practical way.

Applied Mechanics and Materials•Jan 1, 2001•1 citation

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

A Fair Non-Repudiation Protocol without TTP Based on Entity′s Computing Power

Xingfu Wang

With the development of e-commence and other utilities on internet,a new security service——fair non-repudiation becomes more important and crucial.But,most current protocols depend on trusted third party(TTP),so a fair non-repudiation protocol without TTP is needed.But the existing fair protocols don't have equal security for message originator and receiver,and they can not assure the security of the message originator.In this paper,a new protocol is designed for the prior security of the originator,and a fair non-repudiation protocol without TTP based on entity's computing power is proposed to get rid of the dependence on TTP,to solve the security problems that exist when message originator and receiver's computing power are not equal.

Dianzi xuebao•Jan 1, 2006•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
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.
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.
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.
Non-repudiation is one of the most important premises to achieve electronic commerce while fairness is what people have been chasing during electronic transaction. Fair non-repudiation protocols resolve the question of non-repudiation during the course of transferring information in electronic commerce and make all communicating sides in equal positions. That is to say, the protocols are fair for all sides. In the present paper, a fair multi-party non-repudiation protocol based on a group encryption scheme is introduced. The flow of the protocol and its analysis are given in the paper. In the protocol, every side can not have advantages over other sides, because the advantages can result in great loss of other sides. The method that how to solve the dissension with this protocol is also given in the present paper. A trusted third party is used to generate non-repudiation evidence. With this method the number of exchanged messages is small. So this protocol can achieve non-repudiation service in an efficient and practical way.
With the development of e-commence and other utilities on internet,a new security service——fair non-repudiation becomes more important and crucial.But,most current protocols depend on trusted third party(TTP),so a fair non-repudiation protocol without TTP is needed.But the existing fair protocols don't have equal security for message originator and receiver,and they can not assure the security of the message originator.In this paper,a new protocol is designed for the prior security of the originator,and a fair non-repudiation protocol without TTP based on entity's computing power is proposed to get rid of the dependence on TTP,to solve the security problems that exist when message originator and receiver's computing power are not equal.
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.