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

A Fair Exchange Protocol Based on RSA Signature Scheme

Yong Zheng Zhou

Published Jan 1, 2004• 2 citations
OpenAlex

Abstract

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.

Related papers

Simple and Fast Optimistic Fair Exchange Protocol

Changshe Ma

Fair exchange protocol is the basis of secure electronic commerce where the RSA cryptosystem gains comprehensive applications.This paper presents a new efficient verifiable encrypted RSA signature scheme,on which a simple and practical optimistic fair exchange protocol is been devised.Analysis and comparisons show that this protocol is secure and fast.

Jisuanji gongcheng•Jan 1, 2007•0 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 fair-exchange protocols for E-commerce via distributed computation of RSA signatures

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

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.

ACM Symposium on Principles of Distributed Computing (PODC)•Jul 13, 2003•128 citations

Construction of a New CEMBS Based on RSA Cryptosystem

Yong Zheng Zhou

Fairness is one of the basic requirements of E commerce protocols CEMBS is proved to be an important cryptographic building primitive in constructing fair exchange protocols In this paper flaws of the existing CEMBS implementing methods are analyzed A new CEMBS constructing method based on RSA cryptosystem 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 is the first efficient CEMBS based on RSA, which is the most popular public key cryptosystem

Journal of Computer Research and Development•Jan 1, 2004•1 citation

An optimistic fair exchange protocol and its security in the universal composability framework

Yusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto

Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by prescribing three forms of signatures, namely presignature, post-signature and notarised signature. We set an expiration date for presignature, and thus realise the timely termination of the protocol. Next, we define an ideal functionality of fair exchange protocols in the universal composability framework. Then, we construct an optimistic fair exchange protocol based on the above protocol, and prove its security in the universal composability framework.

International Journal of Applied Cryptography•Jan 1, 2008•15 citations

Efficient Fair Exchange from Identity-Based Signature

Dae Hyun Yum, Pil Joong Lee

A fair exchange scheme is a protocol by which two parties Alice and Bob exchange items or services without allowing either party to gain advantages by quitting prematurely or otherwise misbehaving. To this end, modern cryptographic solutions use a semi-trusted arbitrator who involves only in cases where one party attempts to cheat or simply crashes. We call such a fair exchange scheme optimistic. When no registration is required between the signer and the arbitrator, we say that the fair exchange scheme is setup free. To date, the setup-free optimist fair exchange scheme under the standard RSA assumption was only possible from the generic construction of [12], which uses ring signatures. In this paper, we introduce a new setup-free optimistic fair exchange scheme under the standard RSA assumption. Our scheme uses the GQ identity-based signature and is more efficient than [12]. The construction can also be generalized by using various identity-based signature schemes. Our main technique is to allow each user to choose his (or her) own “random” public key in the identitybased signature scheme.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2008•8 citations
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.
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.
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 one of the basic requirements of E commerce protocols CEMBS is proved to be an important cryptographic building primitive in constructing fair exchange protocols In this paper flaws of the existing CEMBS implementing methods are analyzed A new CEMBS constructing method based on RSA cryptosystem 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 is the first efficient CEMBS based on RSA, which is the most popular public key cryptosystem
Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by prescribing three forms of signatures, namely presignature, post-signature and notarised signature. We set an expiration date for presignature, and thus realise the timely termination of the protocol. Next, we define an ideal functionality of fair exchange protocols in the universal composability framework. Then, we construct an optimistic fair exchange protocol based on the above protocol, and prove its security in the universal composability framework.
A fair exchange scheme is a protocol by which two parties Alice and Bob exchange items or services without allowing either party to gain advantages by quitting prematurely or otherwise misbehaving. To this end, modern cryptographic solutions use a semi-trusted arbitrator who involves only in cases where one party attempts to cheat or simply crashes. We call such a fair exchange scheme optimistic. When no registration is required between the signer and the arbitrator, we say that the fair exchange scheme is setup free. To date, the setup-free optimist fair exchange scheme under the standard RSA assumption was only possible from the generic construction of [12], which uses ring signatures. In this paper, we introduce a new setup-free optimistic fair exchange scheme under the standard RSA assumption. Our scheme uses the GQ identity-based signature and is more efficient than [12]. The construction can also be generalized by using various identity-based signature schemes. Our main technique is to allow each user to choose his (or her) own “random” public key in the identitybased signature scheme.