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

International Conference on Information Assurance and Security (IAS)

Multi-party Non-repudiation Protocol with Different Message Exchanged

Yanping Li, Pang Liaojun

Published Jan 1, 2009• 2 citations
Publisher

Abstract

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.

DOI
10.1109/ias.2009.329

Related papers

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

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

A multi-party non-repudiation protocol with semi-trusted third party

Wang Caifen, Jianhua Ge, Xinjun Du +3 more

Multi-party exchange protocols are so widely used in electronic commerce that more and more attention is being paid to designing multi-party protocols or algorithms. Multi-party protocols with non-repudiation play an important role in data fair exchange in the Internet. In this paper, we present a new multi-party protocol with off-line semi-trusted third party (STTP). The protocol is very efficient, at most 5|R|message are broadcast.

IEEE Region 10 Conference (TENCON)•Mar 1, 2004•3 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

A New Multi-party Non-repudiation Protocol without TTP

Pla Information

By analyzing the reference [1],we found some secure hidden dangers in key-base.Because of the deal lack of tags,customers can be cheated when some deals carried on contemporaneously.According to reference[2],we construct a new multi-party non-repudiation protocol using signcrypytion without TTP and analyse its security.Our scheme has higher security and efficiency than reference [1].

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

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