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

IEEE International Conference on Data Science in Cyberspace

Anonymous Fair Exchange Protocol with a Semitrusted Third Party

Lijuan Guo, Xuelian Li, Xiaolin Lv, Juntao Gao

Published Jun 1, 2017• 2 citations
Publisher

Abstract

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.

DOI
10.1109/dsc.2017.38

Related papers

Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce

Ren-Junn Hwang, Chih-Hua Lai

Transaction privacy has attracted a lot of attention in the e-commerce. This study proposes an efficient and provable fair document exchange protocol with transaction privacy. Using the proposed protocol, any untrusted parties can fairly exchange documents without the assistance of online, trusted third parties. Moreover, a notary only notarizes each document once. The authorized document owner can exchange a notarized document with different parties repeatedly without disclosing the origin of the document or the identities of transaction participants. Security and performance analyses indicate that the proposed protocol not only provides strong fairness, non-repudiation of origin, non-repudiation of receipt, and message confidentiality, but also enhances forward secrecy, transaction privacy, and authorized exchange. The proposed protocol is more efficient than other works.

Symmetry•Apr 28, 2015•14 citations

An Optimistic Protocol for Distributed Fair Exchange

Yang Zhao, Zhiguang Qin

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.

International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)•Jul 1, 2012•7 citations

A New Fair-Exchange Protocol

Qing Zhang, Wen Qiao-yan

A new fair exchange protocol with semi-trusted third party is proposed based on a new convertible authenticated encryption scheme.Both security properties and specialties of this protocol are analyzed.The analysis results show that the new protocol has a simpler structure and a lower communication overhead comparing to previous optimistic fair exchange protocols,and the properties of privacy,faireness,non-repudiation and timeliness are satisfied at the same time.

Beijing Youdian Xueyuan xuebao•Jan 1, 2006•0 citations

An improved protocol for optimistic multi-party fair exchange

Yi Liu, Hongli Hu

An exchange protocol is a protocol that allows two or more parties to exchange electronic information. Bao et al. proposed a multi-party fair exchange protocol based on an offline TTP. Participants in this protocol have to trust the initiator of the exchange in addition of the TTP. In this paper we present an improved optimistic multi-party fair exchange protocol in which participants do not have to trust anyone except for the TTP. Moreover, the communication overhead of our protocol is not increased.

Electronic and Mechanical Engineering and Information Technology•Aug 1, 2011•5 citations

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

Collusion-Resistance in Optimistic Fair Exchange

Yang Wang, Willy Susilo, Man Ho Au +1 more

Optimistic fair exchange (OFE) is a type of cryptographic protocols aimed at solving the fair exchange problem over open networks with the help of a third party to settle disputes between exchanging parties. It is well known that a third party is necessary in the realization of a fair exchange protocol. However, a fully trusted third party may not be available over open networks. In this paper, the security of most of the proposed OFE protocols depends on the assumption that the third party is semitrusted in the sense that it may misbehave on its own but does not conspire with either of the main parties. The existing security models of OFE have not taken into account the case where the potentially dishonest third party may collude with a signer in the sense of sharing its secret key with the signer. In this paper, to reduce the trust level of the arbitrator and increase the security of OFE, we propose an enhanced security model that, for the first time, captures this scenario. We also show a separation between the existing model and our enhanced model with a concrete counter example. Finally, we revisit two popular approaches in the construction of OFE protocols, which are based on verifiably encrypted signature and conventional signature plus ring signature, respectively. Our result shows that the conventional signature plus ring signature approach approach remains valid in our enhanced model. However, for schemes based on verifiably encrypted signature, slight modifications are needed to guarantee the security.

IEEE Transactions on Information Forensics and Security•May 21, 2014•2 citations
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.
Transaction privacy has attracted a lot of attention in the e-commerce. This study proposes an efficient and provable fair document exchange protocol with transaction privacy. Using the proposed protocol, any untrusted parties can fairly exchange documents without the assistance of online, trusted third parties. Moreover, a notary only notarizes each document once. The authorized document owner can exchange a notarized document with different parties repeatedly without disclosing the origin of the document or the identities of transaction participants. Security and performance analyses indicate that the proposed protocol not only provides strong fairness, non-repudiation of origin, non-repudiation of receipt, and message confidentiality, but also enhances forward secrecy, transaction privacy, and authorized exchange. The proposed protocol is more efficient than other works.
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.
An exchange protocol is a protocol that allows two or more parties to exchange electronic information. Bao et al. proposed a multi-party fair exchange protocol based on an offline TTP. Participants in this protocol have to trust the initiator of the exchange in addition of the TTP. In this paper we present an improved optimistic multi-party fair exchange protocol in which participants do not have to trust anyone except for the TTP. Moreover, the communication overhead of our protocol is not increased.
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.
Optimistic fair exchange (OFE) is a type of cryptographic protocols aimed at solving the fair exchange problem over open networks with the help of a third party to settle disputes between exchanging parties. It is well known that a third party is necessary in the realization of a fair exchange protocol. However, a fully trusted third party may not be available over open networks. In this paper, the security of most of the proposed OFE protocols depends on the assumption that the third party is semitrusted in the sense that it may misbehave on its own but does not conspire with either of the main parties. The existing security models of OFE have not taken into account the case where the potentially dishonest third party may collude with a signer in the sense of sharing its secret key with the signer. In this paper, to reduce the trust level of the arbitrator and increase the security of OFE, we propose an enhanced security model that, for the first time, captures this scenario. We also show a separation between the existing model and our enhanced model with a concrete counter example. Finally, we revisit two popular approaches in the construction of OFE protocols, which are based on verifiably encrypted signature and conventional signature plus ring signature, respectively. Our result shows that the conventional signature plus ring signature approach approach remains valid in our enhanced model. However, for schemes based on verifiably encrypted signature, slight modifications are needed to guarantee the security.