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

Wuhan University Journal of Natural Sciences

Fair e-payment protocol based on simple partially blind signature scheme

Jingwei Liu, Rong Xia Sun, Weidong Kou

Published Jan 1, 2007• 6 citations
Publisher

Abstract

This paper presents a simple partially blind signature scheme with low computation. By converse using the partially blind signature scheme, we build a simple fair e-payment protocol. In the protocol, two participants achieve the goals of exchanging their digital signatures from each other in a simple way. An advantage of this scheme is that this approach does not require the intervention of the third party in any case. The low-computation property makes our scheme very attractive for mobile client and smart-card implementation in many e-commerce applications.

DOI
10.1007/s11859-006-0287-7

Related papers

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

An Enhanced-Security Fair E-payment Protocol

Wei Fan, Huaying Shu, Elizabeth Fife +1 more

Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) protocol. It can protect both of the participants' profits. Whatpsilas more, in this protocol customers have more initiative, and they can terminate the transaction before possible cheats (while they also should be responsible for the quit), so their security is enhanced. As there is no traditional trusted third party (TTP) in our scheme, network congestion and conspiracy problem can be avoided. Moreover, the protocol satisfies fairness and non-repudiation, and it can also be applied in the digital signature or product exchange process.

•Jan 1, 2009•3 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

An Optimistic Fair Electronic Payment Scheme

Deng Suo

Making use of the idea of convertible digital signature, this paper proposes a new fair electronic payment scheme based on a new interactive verification protocol that is proposed in the paper too. The security of the scheme is based on the hard question of discrete logarithm. The scheme makes both sides in equal positions during the course of electronic transaction. And then, the fairness of electronic transaction is achieved. A trusted third party (TTP) is involved in the scheme to guarantee the fairness of the scheme for both sides. However, only during the course of registration and dispute resolution will TTP be needed. TTP is not needed during the normal payment stage. That is to say, it does not affect efficiency of payment to involving TTP. So the scheme is a fair electronic payment scheme in optimistic sense.

Chinese Journal of Computers•Jan 1, 2002•0 citations

An improved E-payment protocol based on quantum blind signature without entanglement

Xiang-lin Gou, Runhua Shi, Ze Shi +1 more

E-payment plays an important role in modern daily life, so the security problem of E-payment has been widely concerned by researchers. In a recent paper [Int. J. Theor. Phys. 57, 2657 (2018)], the authors presented a trusted third-party E-payment protocol based on quantum blind signature without entanglement. In this paper, we show that there is a serious security flaw in their E-payment protocol. That is, the partial keys will be disclosed by performing a simple attack strategy. Furthermore, we propose an improved E-payment protocol and analyze its security.

Modern Physics Letters A•Jan 20, 2021•6 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
This paper presents a simple partially blind signature scheme with low computation. By converse using the partially blind signature scheme, we build a simple fair e-payment protocol. In the protocol, two participants achieve the goals of exchanging their digital signatures from each other in a simple way. An advantage of this scheme is that this approach does not require the intervention of the third party in any case. The low-computation property makes our scheme very attractive for mobile client and smart-card implementation in many e-commerce applications.
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.
Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) protocol. It can protect both of the participants' profits. Whatpsilas more, in this protocol customers have more initiative, and they can terminate the transaction before possible cheats (while they also should be responsible for the quit), so their security is enhanced. As there is no traditional trusted third party (TTP) in our scheme, network congestion and conspiracy problem can be avoided. Moreover, the protocol satisfies fairness and non-repudiation, and it can also be applied in the digital signature or product exchange process.
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.
Making use of the idea of convertible digital signature, this paper proposes a new fair electronic payment scheme based on a new interactive verification protocol that is proposed in the paper too. The security of the scheme is based on the hard question of discrete logarithm. The scheme makes both sides in equal positions during the course of electronic transaction. And then, the fairness of electronic transaction is achieved. A trusted third party (TTP) is involved in the scheme to guarantee the fairness of the scheme for both sides. However, only during the course of registration and dispute resolution will TTP be needed. TTP is not needed during the normal payment stage. That is to say, it does not affect efficiency of payment to involving TTP. So the scheme is a fair electronic payment scheme in optimistic sense.
E-payment plays an important role in modern daily life, so the security problem of E-payment has been widely concerned by researchers. In a recent paper [Int. J. Theor. Phys. 57, 2657 (2018)], the authors presented a trusted third-party E-payment protocol based on quantum blind signature without entanglement. In this paper, we show that there is a serious security flaw in their E-payment protocol. That is, the partial keys will be disclosed by performing a simple attack strategy. Furthermore, we propose an improved E-payment protocol and analyze its security.
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.