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

New Improvement on a Fair Non-repudiation Protocol

Xiao Jun-mo

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

Zhou-Gollmann protocol is a fair non-repudiation protocol which is widely discussed in recent years.Kim found a flaw of this protocol on time-limited fairness.Aimming at this flaw,Kim gave an improved protocol,but the improved schema highly depended on synchronization of network clock.We analyzed Kim's protocol in detail and show that,without clock synchronization,Kim's improved protocol is also unfair.Then we proposed a new schema to improve it further.Without reducing the efficiency of the original protocol,our new method avoids depending on synchronization of the clock,and keeps fairness and non-repudiation of the protocol.

Related papers

Improving fairness and privacy of Zhou-Gollmann's fair non-repudiation protocol

Kwangjo Kim, Sangjoon Park, Joonsang Baek

We deal with two claws of Zhou-Gollmann's fair non-repudiation protocol. Firstly, their protocol divides a message into 2 parts, i.e., a key K and a ciphertext C. Then, C is delivered to the recipient, while K is submitted to TTP (Trusted Third Party). If the originator doesn't submit K to TTP, then the protocol appears to have no dispute between the originator and the recipient. However the protocol depends on his action on whether the originator really submits K to TTP or not. We show that the originator can make the protocol unfair by using his advantageous position, and present how to improve the fairness of the protocol. Secondly, the protocol doesn't provide the message privacy. This means that additional protocols are required to transfer an important message in private. We propose an improved version of the protocol to guarantee the message privacy.

ICPP Workshops on Collaboration and Mobile Computing•Jan 20, 2003•25 citations

Improvement of Kim's fair non-repudiation protocol

Jianming Zhu

On the basis of illustrating the Kim's fair non-repudiation protocol,the LSG's protocol is analyzed and the unfairness caused by replay attack is pointed,then a new improvement of Kim's protocol is presented and the fairness and accountability is analyzed by the new Kailar logic.

Computer Engineering and Applications Journal•Jan 1, 2009•0 citations

A New Fair and Non-repudiation Protocol

Xiang Li

The non-repudiation and fairness of sender and receiver are essential in secure data transport protocol, it has been usually implemented by non- repudiation protocol used during data transmission. In this paper,a new fair non-repudiation and fairness protocol is presented based on the correction of CMP1 protocol which has some flaws. It has been verified satisfying non-repudiation and fairness by advanced Kailar logic, it can be abroad applied in E-mail and E-contract etc.

Jisuanji gongcheng•Jan 1, 2006•2 citations

New improvement of ZG off-line TTP fair and non-repudiation protocol

Yang Shan-yuan

Based on the weakness that Kremer protocol will cause resolve sub-protocol abused,this paper proposed a new improvement. The new protocol added time limit T0 ,which eliminated the messagee-delay attack,ensured non-repudiation and fairness and could improve the Kremer proposal with resolve sub-protocol abused. It has high efficiency and easy to achieve.

Jisuanji yingyong yanjiu•Jan 1, 2010•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 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
Zhou-Gollmann protocol is a fair non-repudiation protocol which is widely discussed in recent years.Kim found a flaw of this protocol on time-limited fairness.Aimming at this flaw,Kim gave an improved protocol,but the improved schema highly depended on synchronization of network clock.We analyzed Kim's protocol in detail and show that,without clock synchronization,Kim's improved protocol is also unfair.Then we proposed a new schema to improve it further.Without reducing the efficiency of the original protocol,our new method avoids depending on synchronization of the clock,and keeps fairness and non-repudiation of the protocol.
We deal with two claws of Zhou-Gollmann's fair non-repudiation protocol. Firstly, their protocol divides a message into 2 parts, i.e., a key K and a ciphertext C. Then, C is delivered to the recipient, while K is submitted to TTP (Trusted Third Party). If the originator doesn't submit K to TTP, then the protocol appears to have no dispute between the originator and the recipient. However the protocol depends on his action on whether the originator really submits K to TTP or not. We show that the originator can make the protocol unfair by using his advantageous position, and present how to improve the fairness of the protocol. Secondly, the protocol doesn't provide the message privacy. This means that additional protocols are required to transfer an important message in private. We propose an improved version of the protocol to guarantee the message privacy.
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.
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.