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

IEEE Transactions on Information Forensics and Security

An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature

Guilin Wang

Published Nov 13, 2009• 49 citations
Publisher

Abstract

A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in afairway, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property-abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract-signing protocol based on the RSA signature, and show that it is both secure and efficient.

DOI
10.1109/tifs.2009.2035972

Related papers

An efficient free fair contract signing protocol using OTPK

Bhagyashree Bodkhe, Pallavi Jain

Today in the field of security there are various protocols and authentication techniques that makes an application in the network more secure and free from various attacks in the network. There are various applications which require exchange of data between parties. A fair exchange is required since the chances of attacks have been greatly increased. Hence a new protocol has been implemented for the fair exchange of data between parties called contract signing protocol. Although there are various techniques applied for the security of these contract signing protocols such as using RSA [1]. This protocol use RSA to generate digital signature for the authentication of fair exchange between two parties, also in this technique instead of using single TTP (Trusted Third Party) and the trust can be distributed on multi TTP's. But the protocol implemented here in these techniques has less security issues and the chances of attack are more and also by using multiple TTP's storage cost is increased. Hence to overcome these limitations we propose an efficient and secure protocol of contract signing using OTPK (One Time Private Key). This technique requires less storage cost since there is no need to store any key at any end.

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)•Jul 1, 2013•2 citations

Efficient abuse‐free fair contract‐signing protocol based on an ordinary crisp commitment scheme

Alawi A. Al‐Saggaf, Lahouari Ghouti

A mathematical framework for conventional commitment schemes is proposed. Digital contract‐signing protocols represent an important application of the proposed framework, where usually two mistrusted parties wish to exchange their commitments in a fair way. Building on a variant of the proposed framework, an efficient contract‐signing protocol over the Internet is developed. The latter protocol is ‘optimistic, fairness and abuse‐free’. Detailed security and performance analyses are provided. The performance analysis reveals an important computational aspect of the proposed protocol which requires only ‘four rounds’ to complete unlike existing protocols. Moreover, the communication and computational costs are relatively small. Given these theoretical and practical features, the proposed contract‐signing protocol is not only of theoretical interest, but it also enjoys practical merits which make it very suitable for electronic transactions requiring online signature exchange.

IET Information Security•Jul 25, 2014•9 citations

An identity-based scheme of fair exchange of digital signatures

Yong Hong Yu, Bo Yang, Yang Guoqing

Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is “optimistic”, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and efficiently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity-based scheme of fair exchange of digital signatures.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•3 citations

New Optimistic Fair Exchange Protocol Based on Short Signature

Yanbin Sun, Lize Gu, Sihan Qing +3 more

In CIS2008, Gao et al. suggested an abuse-free optimistic fair exchange protocol based on the short signature. Their scheme is very efficient in terms of communication. In this paper, we point out that their scheme has two weaknesses. These weaknesses may lead to an unfair situation that Bob may obtain Alice's signature, but Alice can not obtain Bob's signature. In order to overcome these weaknesses, we propose a new secure abuse-free optimistic fair exchange protocol. In the new protocol, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, we give a formal proof of fairness in the strand space model.

IEEE International Conference on Communication Software and Networks•Jan 1, 2010•7 citations

A Fair Exchange Protocol Based on RSA Signature Scheme

Yong Zheng Zhou

Fairness is the basic requirement of E-Commerce protocols. RSA is one of the most widely used cryptosystems. A fair-exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does. In this paper construction and architecture of the existing fair exchange protocols are analyzed. Both practicality and efficiency problems of these protocols are also presented. Based on this analysis, an optimistic fair exchange protocol totally based on RSA signature scheme is proposed. The novel scheme employs verifiably encrypted RSA signatures in the extended integer ring that is elaborately constructed. The security and efficiency of the newly devised scheme are also proved and examined. It is showed that the proposed scheme is secure and efficient.

•Jan 1, 2004•2 citations

A New Fair Exchange Protocol Using Designated Confirmer Signatures

LU Song-nian

we propose a new efficient protocol. which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way. The protocol relies on an off-line Trusted Third Party (TTP). which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Efficiency of the protocol is achieved by using a cryptographic primitive, called designated confirmer signatures. The confirmer commitment schemes and ordinary signatures are combines to form the confirmer signatures. The security of the protocol is analyzed and the fairness of it is guaranteed.

Jisuanji gongcheng•Jan 1, 2000•0 citations
A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in afairway, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property-abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract-signing protocol based on the RSA signature, and show that it is both secure and efficient.
Today in the field of security there are various protocols and authentication techniques that makes an application in the network more secure and free from various attacks in the network. There are various applications which require exchange of data between parties. A fair exchange is required since the chances of attacks have been greatly increased. Hence a new protocol has been implemented for the fair exchange of data between parties called contract signing protocol. Although there are various techniques applied for the security of these contract signing protocols such as using RSA [1]. This protocol use RSA to generate digital signature for the authentication of fair exchange between two parties, also in this technique instead of using single TTP (Trusted Third Party) and the trust can be distributed on multi TTP's. But the protocol implemented here in these techniques has less security issues and the chances of attack are more and also by using multiple TTP's storage cost is increased. Hence to overcome these limitations we propose an efficient and secure protocol of contract signing using OTPK (One Time Private Key). This technique requires less storage cost since there is no need to store any key at any end.
A mathematical framework for conventional commitment schemes is proposed. Digital contract‐signing protocols represent an important application of the proposed framework, where usually two mistrusted parties wish to exchange their commitments in a fair way. Building on a variant of the proposed framework, an efficient contract‐signing protocol over the Internet is developed. The latter protocol is ‘optimistic, fairness and abuse‐free’. Detailed security and performance analyses are provided. The performance analysis reveals an important computational aspect of the proposed protocol which requires only ‘four rounds’ to complete unlike existing protocols. Moreover, the communication and computational costs are relatively small. Given these theoretical and practical features, the proposed contract‐signing protocol is not only of theoretical interest, but it also enjoys practical merits which make it very suitable for electronic transactions requiring online signature exchange.
Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is “optimistic”, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and efficiently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity-based scheme of fair exchange of digital signatures.
In CIS2008, Gao et al. suggested an abuse-free optimistic fair exchange protocol based on the short signature. Their scheme is very efficient in terms of communication. In this paper, we point out that their scheme has two weaknesses. These weaknesses may lead to an unfair situation that Bob may obtain Alice's signature, but Alice can not obtain Bob's signature. In order to overcome these weaknesses, we propose a new secure abuse-free optimistic fair exchange protocol. In the new protocol, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, we give a formal proof of fairness in the strand space model.
Fairness is the basic requirement of E-Commerce protocols. RSA is one of the most widely used cryptosystems. A fair-exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does. In this paper construction and architecture of the existing fair exchange protocols are analyzed. Both practicality and efficiency problems of these protocols are also presented. Based on this analysis, an optimistic fair exchange protocol totally based on RSA signature scheme is proposed. The novel scheme employs verifiably encrypted RSA signatures in the extended integer ring that is elaborately constructed. The security and efficiency of the newly devised scheme are also proved and examined. It is showed that the proposed scheme is secure and efficient.
we propose a new efficient protocol. which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way. The protocol relies on an off-line Trusted Third Party (TTP). which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Efficiency of the protocol is achieved by using a cryptographic primitive, called designated confirmer signatures. The confirmer commitment schemes and ordinary signatures are combines to form the confirmer signatures. The security of the protocol is analyzed and the fairness of it is guaranteed.