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

International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

An Optimistic Protocol for Distributed Fair Exchange

Yang Zhao, Zhiguang Qin

Published Jul 1, 2012• 7 citations
Publisher

Abstract

This paper presents an optimistic protocol based on the scheme of public verifiable secret share for distributed fair exchange. A distributed third party is designed to guarantee the fairness of exchange. Comparing to traditional trusted third party, this distributed third party is not fixed but dynamically selected by the players of exchange. This solution can effectively remove the risk of single point of failure and defend compromising attacks. The results of protocol analysis show that the protocol guarantees strong fairness and effectiveness of up to one-half malicious participants in distributed third party.

DOI
10.1109/imis.2012.196

Related papers

Fair Exchange Protocol with Distributed Semi-trusted Third Party

Futai Zhang

The techniques of verifiable secret sharing and verifiable encryption are used in the construction of two party fair exchange protocols.The novelty of the construction lies in the introduction of the distributed semi-trusted third party.Compared to the previous fair exchange protocols with a single semi-trusted third party,the newly constructed fair exchange protocol can further guarantee the security and fairness of the transaction due to the existence of the distributed semi-trusted third party.

Jisuanji gongcheng•Jan 1, 2006•0 citations

Optimistic fair exchange e-commerce protocol based on secret sharing

Changshe Ma, Feiyu Lei, Chen Kefei

A key problem of electronic commerce (for short e-commerce) is fair exchange which guarantees that at the end of the transaction, either both parties in the transaction receive each other's items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants' items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified (2,2) secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.

Journal of Systems Engineering and Electronics•Dec 1, 2006•3 citations

Anonymous Fair Exchange Protocol with a Semitrusted Third Party

Lijuan Guo, Xuelian Li, Xiaolin Lv +1 more

Anonymity attracts wide attention in the electronic transaction, but participants usually do not trust each other. The problem inspires researchers to provide fair exchange protocol based on the third party. However, the third party is fully trusted and vulnerable to attack. This paper proposes an asynchronous optimistic fair exchange protocol. One of the important contributions is to preserve the anonymity even against a semitrusted third party. More importantly, the proposed protocol has minimal dependencies on the semitrusted third party as participants are forced to be honest. Meanwhile, the monopoly information owner can exchange the authentication information with different participants. Security analysis and performance comparison show that our constructions not only ensure transaction privacy and fairness, but also enjoy high efficiency.

IEEE International Conference on Data Science in Cyberspace•Jun 1, 2017•2 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

A fair multi-party exchange protocol with theoff-line trusted third party

Jianzhong Zhang

The difference between the fair exchange protocols and the non-repudiation protocols is proposed. Based on the publicly verifiable secret sharing scheme and group encryption scheme, a new multi-party fair exchagne protocol with an off-line semi-Trusted Third Party(off-STTP) is presented. The off-STTP who need not be completely trusted intervenes into the exchange in case of trouble. That the off-STTP can only decipher a sub-secret key makes sure the confidentiality of exchange data and the true fairness of the barter. The participants can barter with others at their will and the exchange topology is unknown to others including the off-STTP.

Journal of Xidian University•Jan 1, 2004•0 citations

A multiparty fair-exchange protocol

Zhengquan Li

Based on the secret sharing technique,this paper proposes a multi-party fair exchange protocol.The protocol uses an online trusted third party(TTP) in order to help the participants to realize fair exchange.The advantage of a protocol implemented with an online TTP is that the TTP is semi-trusted.Fairness of the proposed protocol is proved in this paper.

Journal of Yangzhou University•Jan 1, 2008•0 citations
This paper presents an optimistic protocol based on the scheme of public verifiable secret share for distributed fair exchange. A distributed third party is designed to guarantee the fairness of exchange. Comparing to traditional trusted third party, this distributed third party is not fixed but dynamically selected by the players of exchange. This solution can effectively remove the risk of single point of failure and defend compromising attacks. The results of protocol analysis show that the protocol guarantees strong fairness and effectiveness of up to one-half malicious participants in distributed third party.
The techniques of verifiable secret sharing and verifiable encryption are used in the construction of two party fair exchange protocols.The novelty of the construction lies in the introduction of the distributed semi-trusted third party.Compared to the previous fair exchange protocols with a single semi-trusted third party,the newly constructed fair exchange protocol can further guarantee the security and fairness of the transaction due to the existence of the distributed semi-trusted third party.
A key problem of electronic commerce (for short e-commerce) is fair exchange which guarantees that at the end of the transaction, either both parties in the transaction receive each other's items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants' items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified (2,2) secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.
Anonymity attracts wide attention in the electronic transaction, but participants usually do not trust each other. The problem inspires researchers to provide fair exchange protocol based on the third party. However, the third party is fully trusted and vulnerable to attack. This paper proposes an asynchronous optimistic fair exchange protocol. One of the important contributions is to preserve the anonymity even against a semitrusted third party. More importantly, the proposed protocol has minimal dependencies on the semitrusted third party as participants are forced to be honest. Meanwhile, the monopoly information owner can exchange the authentication information with different participants. Security analysis and performance comparison show that our constructions not only ensure transaction privacy and fairness, but also enjoy high efficiency.
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.
The difference between the fair exchange protocols and the non-repudiation protocols is proposed. Based on the publicly verifiable secret sharing scheme and group encryption scheme, a new multi-party fair exchagne protocol with an off-line semi-Trusted Third Party(off-STTP) is presented. The off-STTP who need not be completely trusted intervenes into the exchange in case of trouble. That the off-STTP can only decipher a sub-secret key makes sure the confidentiality of exchange data and the true fairness of the barter. The participants can barter with others at their will and the exchange topology is unknown to others including the off-STTP.