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

Chinese Journal of Computers

An Optimistic Fair Electronic Payment Scheme

Deng Suo

Published Jan 1, 2002• 0 citations
OpenAlex

Abstract

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.

Related papers

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

A fair exchange protocol based on short signature with the off-line semi-trusted third party

Xiangjun Xin, Fagen Li

Based on a short signature scheme and discrete logarithm problem,a new fair exchange protocol with the off-line semi-Trusted Third Party(TTP) is proposed.The off-line semi-TTP intervenes into the protocol in case of trouble,which makes the fair exchange optimistic.The off-line TTP need not be completely trusted,since it can get neither signature exchanged when disputation is solved.Because this protocol is based on short signature,which needs low storage and little communication,it can be used in low-bandwidth communication and low-storage environments.

Journal of Xidian University•Jan 1, 2007•0 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

A gradual and optimistic fair exchange protocol

Tian Lan, Zhiguang Qin, Yang Zhao +2 more

For electronic items without generability or revocability, previous optimistic exchange protocols can't guarantee strong fairness. Gradual protocols assume equal computing power. And online-TTP (Third Trusted Party) protocols often suffer from communication bottle-neck. A gradual and optimistic fair exchange protocol is presented in this paper to solve the problem. Secrets are gradually exchanged with partially validation by recipients, while the probability of detecting cheats increases. Fairness doesn't depend on equal computational power assumption. TTP isn't involved unless dispute appears. The protocol provides stronger fairness than optimistic or gradual schemes.

International Conference on Communications, Circuits and Systems•Jul 1, 2007•2 citations

Verifiable encryption of digital signatures and applications

Giuseppe Ateniese

This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build efficient fair exchange and certified e-mail protocols.

ACM Transactions on Information and System Security•Feb 1, 2004•96 citations

Design and evaluate a fair exchange protocol based on online trusted third party (TTP)

Abdullah Shawan Alotaibi

One of the most crucial factors that e-commerce protocols should address is a fair exchange. In this research, an advanced method of cryptography coupled with the pay per use technique is used. A new electronic commerce protocol for the exchange of commodities is introduced. The proposed new protocol guarantees both features while addressing the main drawbacks associated with other related protocols. The new suggested e-commerce protocol is composed of two stages: pre-exchange and exchange stages. When the suggested new protocol is analysed with scrupulous protocol analysis, it attains fair exchange and a secure method of payment. The suggested new e-commerce protocol is more efficient than other related existing protocols. In this research “protocol prototype” and “model checking” is used for the purpose of authentication. The protocol prototype verifies that the suggested new protocol is executable when it's used in a real context. By experimental designs, this research shows the length of asymmetric keys as the biggest element that affects the efficiency of the protocol. When model-checking is applied in this protocol, the outcome indicates that the suggested protocol achieves the required features of fairness. Protocol extensions give those involved in the protocol the capacity to be resilient to failure. By using three methods of authentication, this research confirms that the new proposed protocol is well formulated. The work reported in this thesis first study the existing fair exchange protocols that solve the fairness problem. Then, propose more efficient protocol to solve the fairness problem. The original idea in this thesis is to reduce the communication overheads, risks and solve the bottleneck problems in the protocols that involve an online TTP.

•Jan 1, 2012•1 citation
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.
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.
Based on a short signature scheme and discrete logarithm problem,a new fair exchange protocol with the off-line semi-Trusted Third Party(TTP) is proposed.The off-line semi-TTP intervenes into the protocol in case of trouble,which makes the fair exchange optimistic.The off-line TTP need not be completely trusted,since it can get neither signature exchanged when disputation is solved.Because this protocol is based on short signature,which needs low storage and little communication,it can be used in low-bandwidth communication and low-storage environments.
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.
For electronic items without generability or revocability, previous optimistic exchange protocols can't guarantee strong fairness. Gradual protocols assume equal computing power. And online-TTP (Third Trusted Party) protocols often suffer from communication bottle-neck. A gradual and optimistic fair exchange protocol is presented in this paper to solve the problem. Secrets are gradually exchanged with partially validation by recipients, while the probability of detecting cheats increases. Fairness doesn't depend on equal computational power assumption. TTP isn't involved unless dispute appears. The protocol provides stronger fairness than optimistic or gradual schemes.
One of the most crucial factors that e-commerce protocols should address is a fair exchange. In this research, an advanced method of cryptography coupled with the pay per use technique is used. A new electronic commerce protocol for the exchange of commodities is introduced. The proposed new protocol guarantees both features while addressing the main drawbacks associated with other related protocols. The new suggested e-commerce protocol is composed of two stages: pre-exchange and exchange stages. When the suggested new protocol is analysed with scrupulous protocol analysis, it attains fair exchange and a secure method of payment. The suggested new e-commerce protocol is more efficient than other related existing protocols. In this research “protocol prototype” and “model checking” is used for the purpose of authentication. The protocol prototype verifies that the suggested new protocol is executable when it's used in a real context. By experimental designs, this research shows the length of asymmetric keys as the biggest element that affects the efficiency of the protocol. When model-checking is applied in this protocol, the outcome indicates that the suggested protocol achieves the required features of fairness. Protocol extensions give those involved in the protocol the capacity to be resilient to failure. By using three methods of authentication, this research confirms that the new proposed protocol is well formulated. The work reported in this thesis first study the existing fair exchange protocols that solve the fairness problem. Then, propose more efficient protocol to solve the fairness problem. The original idea in this thesis is to reduce the communication overheads, risks and solve the bottleneck problems in the protocols that involve an online TTP.