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

Jisuanji yingyong yanjiu

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

Yang Shan-yuan

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

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.

Related papers

Analysis and improvement of ZG off-line TTP non-repudiation protocol

Dongmei Liu, Sihan Qing, Pengfei Li +1 more

Based on the weakness of ZG off-line TTP（trusted third party） non-repudiation protocol because of using pro-tocol deadline, the improvement of the ZG off-line TTP non-repudiation protocol was given, which eliminated the delay-ing resolve request attack and ensured non-repudiation and fairness.Therefore, two kinds of improvement of ZG off-line TTP non-repudiation protocol were given, which had different point of focus.Among them, the first one could eliminate delaying message attack in ZG protocol;the second one also had the property of preventing the abuse of sub-protocol be-sides eliminating delaying message attack.The first one is suitable for electronic payment and certified email, but the second one is suitable for digital contract signature.

Journal of Communications•Jan 1, 2009•0 citations

A fair non-repudiation security protocol with off-line TTP

Xi Wang, Xiangming Wen, Ye Liu +2 more

A fair non-repudiation security protocol can provide non-repudiation proof for two parts of the exchange at the same time, or both get nothing. But many protocols performed weak in logical analysis. In this paper, a group of new protocols(with 3 sub-protocols) with off-line The Third Party(TTP) are presented. We analysis them with a new Kailar logic analytical method. Finally, the proposed protocols are proved to satisfy the fairness, non-repudiation and efficiency from the theory. And they propose some protections for the networks which have merely physical securities such as Internet, and provide some realistic reference values to the establishment of security mobile ad-hoc networks.

IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)•Jul 1, 2009•1 citation

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 Non-repudiation Protocol with Many Off-line TTPs

Jianzhong Zhang

A fair non-repudiation protocol with many off-line TTPs is proposed.In contrast to the previous protocols,it diverts one TTP's task to t TTP,and decreases the dependence of the protocol to one TTP.It can test dishonest TTPs,and it realizes TTP's transparency.

Jisuanji yingyong yanjiu•Jan 1, 2006•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

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
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.
Based on the weakness of ZG off-line TTP（trusted third party） non-repudiation protocol because of using pro-tocol deadline, the improvement of the ZG off-line TTP non-repudiation protocol was given, which eliminated the delay-ing resolve request attack and ensured non-repudiation and fairness.Therefore, two kinds of improvement of ZG off-line TTP non-repudiation protocol were given, which had different point of focus.Among them, the first one could eliminate delaying message attack in ZG protocol;the second one also had the property of preventing the abuse of sub-protocol be-sides eliminating delaying message attack.The first one is suitable for electronic payment and certified email, but the second one is suitable for digital contract signature.
A fair non-repudiation security protocol can provide non-repudiation proof for two parts of the exchange at the same time, or both get nothing. But many protocols performed weak in logical analysis. In this paper, a group of new protocols(with 3 sub-protocols) with off-line The Third Party(TTP) are presented. We analysis them with a new Kailar logic analytical method. Finally, the proposed protocols are proved to satisfy the fairness, non-repudiation and efficiency from the theory. And they propose some protections for the networks which have merely physical securities such as Internet, and provide some realistic reference values to the establishment of security mobile ad-hoc networks.
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.
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.