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

Journal of Communications

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

Dongmei Liu, Sihan Qing, Pengfei Li, Li Shang-Jie

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

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.

Related papers

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

Multi-party Non-repudiation Protocol with Different Message Exchanged

Yanping Li, Pang Liaojun

Based on the hardness assumption of discrete logarithm problem and a group oriented encryption scheme, a new multi-party non-repudiation protocol is presented. The features of this protocol are the following: In the B2C or B2B e-commerce application,it is necessary for an organisations/people to deal with all kinds of requests, business documents, agreements, payments, contracts, acknowledgments as a batch.The protocol allows such organisations/people to send different messages to multiple different recipients, eliminates the previous restriction on the exchange of the same message. The protocol also utilizes an off-line third trusted party (TTP for short) and has higher efficiency than those protocols with an on-line TTP.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•2 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

An Optimistic Non-repudiation Protocol Focused on Transparent Trusted Third Party

Qiang Li, Kaigui Wu, Fang Li

Non-repudiation service is widely employed in information exchange and online transaction. It requires that its participants are unable to deny their involvement in specific protocol. At the same time, the service should keep fairness, which means that no one could take any advantages over the other one. Researchers have introduced a trusted third party (TTP) to realize these demands. Protocols are grouped into several categories according to the degree of TTP's involvement in protocols. Optimistic non-repudiation protocol is the most important method undoubtedly owe to its lower TTP's involvement. There are two questions. One is that whether it is possible to further decrease TTP's involvement or not. A computable optimistic non-repudiation protocol seems to be a good improvement. This is also our paper's basic protocol. The other question is about whether two types of finally evidences that produced by participants (here is Alice and Bob, and we denote this type evidences as the first type evidences) and TTP (or with the help of TTP, and we demote this type evidences as the second type evidences) are identical. If both types of evidences are not exactly the same, then it shows that TTP has taken part in process of protocol. Thus, it is certain that either participants behaved dishonest, or network went wrong. Participants' prestige will be negatively affected more or less. On the contrary, if two types of evidences are identical, then such feelings will be eliminated. This kind of TTP is called transparent TTP. In this paper, we have accomplished an optimistic non-repudiation protocol with the help of transparent TTP based on a computable non-repudiation protocol.

•Nov 1, 2013•1 citation

Non-repudiation protocol based on conditional trusted third party

Chun Chen

The idea of TTP was developed on the basis semi-trusted TTP. The term of conditional trusted third means that on the condition of third party satisfying the pre-conditions, if he behaves right, then he is trusted, else his behavior can be checked by participators of the protocol. A new protocol adopting off-line and TTP was put forward. Compared with available non-repudiation protocols, this one progresses further in reducing intervention of TTP in fair exchange.

Journal of Zhejiang University(Engineering Science)•Jan 1, 2004•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
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.
Based on the hardness assumption of discrete logarithm problem and a group oriented encryption scheme, a new multi-party non-repudiation protocol is presented. The features of this protocol are the following: In the B2C or B2B e-commerce application,it is necessary for an organisations/people to deal with all kinds of requests, business documents, agreements, payments, contracts, acknowledgments as a batch.The protocol allows such organisations/people to send different messages to multiple different recipients, eliminates the previous restriction on the exchange of the same message. The protocol also utilizes an off-line third trusted party (TTP for short) and has higher efficiency than those protocols with an on-line TTP.
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.
Non-repudiation service is widely employed in information exchange and online transaction. It requires that its participants are unable to deny their involvement in specific protocol. At the same time, the service should keep fairness, which means that no one could take any advantages over the other one. Researchers have introduced a trusted third party (TTP) to realize these demands. Protocols are grouped into several categories according to the degree of TTP's involvement in protocols. Optimistic non-repudiation protocol is the most important method undoubtedly owe to its lower TTP's involvement. There are two questions. One is that whether it is possible to further decrease TTP's involvement or not. A computable optimistic non-repudiation protocol seems to be a good improvement. This is also our paper's basic protocol. The other question is about whether two types of finally evidences that produced by participants (here is Alice and Bob, and we denote this type evidences as the first type evidences) and TTP (or with the help of TTP, and we demote this type evidences as the second type evidences) are identical. If both types of evidences are not exactly the same, then it shows that TTP has taken part in process of protocol. Thus, it is certain that either participants behaved dishonest, or network went wrong. Participants' prestige will be negatively affected more or less. On the contrary, if two types of evidences are identical, then such feelings will be eliminated. This kind of TTP is called transparent TTP. In this paper, we have accomplished an optimistic non-repudiation protocol with the help of transparent TTP based on a computable non-repudiation protocol.
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.