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

Multi-party Non-repudiation Protocol Using Key Chains

Yumin Wang

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

The previous multi-party non-repudiation protocols normally focus on one round message exchange.The multi-round message exchanges within the same participatores are not studied well.For the latter condition,we presented a multi-party non-repudiation protocol using key chains which can reduce the TTP's storage requirements.The protocol consists of a dispute resolution policy and four sub-protocols,i.e.,the initialization sub-protocol,the exchange sub-protocol,the abort sub-protocol and the recovery sub-protocol.Technical discussions show that the protocol satisfies fairness,timeliness and confidentiality.

Related papers

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

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

Formal Analysis Of Multi-party Non-repudiation Protocols Without TTP

Xiaoqiong Wang, Xueming Wang

Non-repudiation service is crucial to electronic commerce. Now multi-party non-repudiation is a new focus of research. This paper presents a multi-party non-repudiation protocol, based on a group encryption scheme. A multi-party non-repudiation problem is defined in this paper. This definition and the resulting protocol are more general than the other comparable work. At last, an example of fair multi-party non-repudiation protocol without a trusted third party (TTP) is given out, which uses formal method of SVO logic to analyze the protocol and prove its correctness.

International Conference on Communications and Intelligence Information Security (ICCIIS)•Oct 1, 2010•1 citation

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

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
The previous multi-party non-repudiation protocols normally focus on one round message exchange.The multi-round message exchanges within the same participatores are not studied well.For the latter condition,we presented a multi-party non-repudiation protocol using key chains which can reduce the TTP's storage requirements.The protocol consists of a dispute resolution policy and four sub-protocols,i.e.,the initialization sub-protocol,the exchange sub-protocol,the abort sub-protocol and the recovery sub-protocol.Technical discussions show that the protocol satisfies fairness,timeliness and confidentiality.
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 crucial to electronic commerce. Now multi-party non-repudiation is a new focus of research. This paper presents a multi-party non-repudiation protocol, based on a group encryption scheme. A multi-party non-repudiation problem is defined in this paper. This definition and the resulting protocol are more general than the other comparable work. At last, an example of fair multi-party non-repudiation protocol without a trusted third party (TTP) is given out, which uses formal method of SVO logic to analyze the protocol and prove its correctness.
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.
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.