© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

ACM Symposium on Principles of Distributed Computing (PODC)

Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures

Jung Min Park, Edwin K. P. Chong, Howard Jay Siegel

Published Jul 13, 2003• 128 citations

Abstract

Applications such as e-commerce payment protocols, elec-tronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol al-lows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does. We describe a novel method of constructing very ef-ficient fair-exchange protocols by distributing the computa-tion of RSA signatures. Specifically, we employ multisig-natures based on the RSA-signature scheme. To date, the vast majority of fair-exchange protocols require the use of zero-knowledge proofs, which is the most computationally intensive part of the exchange protocol. Using the intrinsic features of our multisignature model, we construct protocols that require no zero-knowledge proofs in the exchange proto-col. Use of zero-knowledge proofs is needed only in the pro-tocol setup phase--this is a one-time cost. Furthermore, our scheme uses multisignatures that are compatible with the underlying standard (single-signer) signature scheme, which makes it possible to readily integrate the fair-exchange fea-ture with existing e-commerce systems.

DOI: 10.1145/872035.872060

Related papers

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

Efficient Fair Exchange Protocol Based on RSA Blind Signature

Yu Wang

Due to the widespread use of electronic commerce and popularization,make mutual distrust to two or more parties rely on Internet information. Fair exchange protocol as the key password technology of electronic commerce,is crucial. Through the study of existing fair exchange protocol with classification,found some existing fair exchange protocol to third- party intervention. Based on RSA blind signature,this paper proposes a safe and efficient,but the actual operation of no the third party to participate in the fair electronic exchange protocol,for constructing a fair electronic payment protocols and fair electronic contract signing protocol provides a valid password tool.

Journal of Changsha University•Jan 1, 2015•0 citations

Ecient Fair Exchange with Veriable Conrmation of Signatures

Liqun Chen

We propose a new ecient protocol, which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way, such that after the protocol is running, either each party obtains the other's signature, or neither of them does. The pro- tocol relies on an o-line Trusted Third Party (TTP), which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Eciency of the protocol is achieved by using a cryptographic primitive, called conrmable signatures (or designated con- rmer signatures in its original proposal (9)). We recommend using a new ecient conrmable signature scheme in the proposed fair exchange pro- tocol. This scheme combines the family of discrete logarithm (DL) based signature algorithms and a zero-knowledge (ZK) proof on the equality of two DLs. The protocol has a practical level of performance: only a moderate number of communication rounds and ordinary signatures are required. The security of the protocol can be established from that of the underlying signature algorithms and that of the ZK proof used.

•Jan 1, 1998•2 citations

A new CEMBS based on RSA signatures and its application in constructing fair exchange protocol

Yongbin Zhou, Zhenfeng Zhang, Qing Si-Han +1 more

Fairness is one of the basic requirements of e-commerce protocols and applications. CEMBS is proved to be an important cryptographic building primitive in constructing fair exchange protocols. In this paper the drawbacks of existing CEMBS-implementing methods are analyzed. A new CEMBS-constructing method based on RSA signature is proposed, which is proved to be simple, efficient and secure. Afterwards, a fair exchange protocol is built using the newly constructed CEMBS. And the devised scheme in this paper is the first efficient CEMBS based on RSA signatures.

•Jan 1, 2004•7 citations

Constructing Optimistic Fair Exchange Protocols from Committed Signatures.

Huafei Zhu

In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having cosigner store a piece of prime signer's secret key. Dodis and Reyzin [20] showed that the protocol in [32] is totally breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model, by utilizing Boldyreva non-interactive two-party multi-signature scheme [8]. Security in the random oracle model does not imply security in the real world. In this paper, we provide the first two e#cient committed signatures which are provably secure in the standard complexity model from strong RSA assumption. Then we construct e#cient optimistic fair exchange protocols from those new primitives.

•Jan 1, 2003•4 citations

Signcryption-based fair exchange protocol

Yingyou Wen

By introducing signcryption technology into concurrent signature,a signcryption-based concurrent signature scheme was presented,which was proven to have the existential unforgeability against adaptive chosen messages attacks under the random oracle model,Based on this scheme,a fair exchange protocol was proposed,which could be used to exchange digital goods.This protocol did not need secure communications channel,in which two parties generate sym-metrical ambiguous signatures and individual keystones were released by themselves,which ensured the properties of confidentiality,ambiguousness and fairness,which made our protocol could be used in e-commerce payment,e-contract signing,mail authentication,etc.

Journal of Communications•Jan 1, 2010•3 citations

Applications such as e-commerce payment protocols, elec-tronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol al-lows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does. We describe a novel method of constructing very ef-ficient fair-exchange protocols by distributing the computa-tion of RSA signatures. Specifically, we employ multisig-natures based on the RSA-signature scheme. To date, the vast majority of fair-exchange protocols require the use of zero-knowledge proofs, which is the most computationally intensive part of the exchange protocol. Using the intrinsic features of our multisignature model, we construct protocols that require no zero-knowledge proofs in the exchange proto-col. Use of zero-knowledge proofs is needed only in the pro-tocol setup phase--this is a one-time cost. Furthermore, our scheme uses multisignatures that are compatible with the underlying standard (single-signer) signature scheme, which makes it possible to readily integrate the fair-exchange fea-ture with existing e-commerce systems.

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.

Due to the widespread use of electronic commerce and popularization,make mutual distrust to two or more parties rely on Internet information. Fair exchange protocol as the key password technology of electronic commerce,is crucial. Through the study of existing fair exchange protocol with classification,found some existing fair exchange protocol to third- party intervention. Based on RSA blind signature,this paper proposes a safe and efficient,but the actual operation of no the third party to participate in the fair electronic exchange protocol,for constructing a fair electronic payment protocols and fair electronic contract signing protocol provides a valid password tool.

We propose a new ecient protocol, which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way, such that after the protocol is running, either each party obtains the other's signature, or neither of them does. The pro- tocol relies on an o-line Trusted Third Party (TTP), which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Eciency of the protocol is achieved by using a cryptographic primitive, called conrmable signatures (or designated con- rmer signatures in its original proposal (9)). We recommend using a new ecient conrmable signature scheme in the proposed fair exchange pro- tocol. This scheme combines the family of discrete logarithm (DL) based signature algorithms and a zero-knowledge (ZK) proof on the equality of two DLs. The protocol has a practical level of performance: only a moderate number of communication rounds and ordinary signatures are required. The security of the protocol can be established from that of the underlying signature algorithms and that of the ZK proof used.

Fairness is one of the basic requirements of e-commerce protocols and applications. CEMBS is proved to be an important cryptographic building primitive in constructing fair exchange protocols. In this paper the drawbacks of existing CEMBS-implementing methods are analyzed. A new CEMBS-constructing method based on RSA signature is proposed, which is proved to be simple, efficient and secure. Afterwards, a fair exchange protocol is built using the newly constructed CEMBS. And the devised scheme in this paper is the first efficient CEMBS based on RSA signatures.

In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having cosigner store a piece of prime signer's secret key. Dodis and Reyzin [20] showed that the protocol in [32] is totally breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model, by utilizing Boldyreva non-interactive two-party multi-signature scheme [8]. Security in the random oracle model does not imply security in the real world. In this paper, we provide the first two e#cient committed signatures which are provably secure in the standard complexity model from strong RSA assumption. Then we construct e#cient optimistic fair exchange protocols from those new primitives.

By introducing signcryption technology into concurrent signature,a signcryption-based concurrent signature scheme was presented,which was proven to have the existential unforgeability against adaptive chosen messages attacks under the random oracle model,Based on this scheme,a fair exchange protocol was proposed,which could be used to exchange digital goods.This protocol did not need secure communications channel,in which two parties generate sym-metrical ambiguous signatures and individual keystones were released by themselves,which ensured the properties of confidentiality,ambiguousness and fairness,which made our protocol could be used in e-commerce payment,e-contract signing,mail authentication,etc.