© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Applied Mechanics and Materials

A FAIR MULTI-PARTY NON-REPUDIATION PROTOCOL

Deng Suo-yun

Published Jan 1, 2001• 1 citation

Abstract

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.

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 New Fair Non-Repudiation Protocol with Off-Line Semi-Trusted Third Party

Cai Wang

Non repudiation and fairness turn out to be two important security properties of electronic commerce protocols.In this paper,based on a verifiable encryption with blind decryption,we present a new fair non repudiation protocol with off line semi trusted third party,so either transaction party can unilaterally bring a transaction to completion without losing fairness.This is the first non repudiation protocol with off line semi trusted third party.

Dianzi xuebao•Jan 1, 2002•0 citations

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

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

An efficient non-repudiation protocol

Jianying Zhou, Dieter Gollmann

Fairness may be a desirable property of a non-repudiation service. Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the workload of the trusted third party. In this paper, we present a variant of our fair non-repudiation protocol (1996), where the trusted third party is involved only in the case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.

IEEE Computer Security Foundations Workshop (CSFW)•Nov 22, 2002•151 citations

Analysis and Improvement of a Mutually Undeniable Cryptographic Protocol

Yanping Li

Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in e-commerce. Non-repudiation protocol is a special network protocol which provides non-repudiation service. Because of the importance of non-repudiation to electronic commerce activities and the fact that non-repudiation protocol is relatively few, this paper adopts the modern cryptographic algorithms and techniques and designs a mutually undeniable cryptographic protocol. Analyses show that the improved protocol avoids the trusted third party being the bottleneck problem, and also realizes the confidentiality of transferring data, and the fairness and non-repudiation of the sender and the receiver.

Journal of Huaihai Institute of Technology•Jan 1, 2006•0 citations

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.

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.

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.

Fairness may be a desirable property of a non-repudiation service. Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the workload of the trusted third party. In this paper, we present a variant of our fair non-repudiation protocol (1996), where the trusted third party is involved only in the case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.

Non-repudiation service is the foundation of security on which important data and sensitive news are conveyed on the Internet in e-commerce. Non-repudiation protocol is a special network protocol which provides non-repudiation service. Because of the importance of non-repudiation to electronic commerce activities and the fact that non-repudiation protocol is relatively few, this paper adopts the modern cryptographic algorithms and techniques and designs a mutually undeniable cryptographic protocol. Analyses show that the improved protocol avoids the trusted third party being the bottleneck problem, and also realizes the confidentiality of transferring data, and the fairness and non-repudiation of the sender and the receiver.