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

Computer Engineering and Applications Journal

Improvement of Kim's fair non-repudiation protocol

Jianming Zhu

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

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.

Related papers

An Improved Non-Repudiation Protocol and Its Security Analysis

Lili, ZHANGHuan-guo, WANGLi-na

This paper proposes an improved non-repudiation protocol after pointing out two attacks on an existing non-repudiation protocol. To analyze the improved protocol,it also proposes an extension of Kailar logic. Using the extended Kailar logic, the security analysis of the improved protocol has been presented.

Wuhan University Journal of Natural Sciences•Jan 1, 2004•0 citations

New Improvement on a Fair Non-repudiation Protocol

Xiao Jun-mo

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.

•Jan 1, 2009•0 citations

An improved non-repudiation protocol and its security analysis

Li Li, Huanguo Zhang, Lina Wang

This paper proposes an improved non-repudiation protocol after pointing out two attacks on an existing non-repudiation protocol. To analyze the improved protocol, it also proposes an extension of Kailar logic. Using the extended Kailar logic, the security analysis of the improved prototocol has been presented.

Wuhan University Journal of Natural Sciences•May 1, 2004•6 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

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
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.