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 Communications, Circuits and Systems

Multi-party fair exchange protocol with an Off-line Semi-Trust Third Party

Yang Zhao, Zhiguang Qin, Tian Lan, Hu Xiong, Fengli Zhang

Published Jul 1, 2007• 0 citations
Publisher

Abstract

A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange electronic items in such a way that everyone gives an item away if and only if it receives an item in return. In this paper, we present a new multi-party fair exchange protocol with an Off-line Semi-Trust Third Party (OSTTP). The new protocol can ensure strong fairness and the OSTTP can't get the exchanged secrets without conspiring with any participants.

DOI
10.1109/icccas.2007.6251607

Related papers

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

New Multi-party Fair Exchange Protocol with Off-line Semi-trusted Third Party

DU Hong-zhen, Jianzhong Zhang

At present,the study of multi-party fair exchange protocol is very weak.Aiming at solving the problem,we present a secure and efficient multi-party fair exchange protocol with off-line semi-trusted third party on the basis of Zheng scheme.

Jisuanji yingyong yanjiu•Jan 1, 2006•0 citations

Fair Document Exchange Protocol with Confidentiality

Xiaoxin Ye, Zhenfu Cao, Xiaohui Liang

The paper proposes a new fair document exchange protocol.In such a fair exchange scenario,each party owns a valuable secret message and they want to exchange their secrets in a fairness way so that at the end of the transaction,either both of them get the other’s secret or neither of them gets the other’s secret.Compared with previous fair exchange protocols,the protocol holds confidentiality,that is,except the two participating party,no one even the Trusted Third Party(TTP) can get exchanged items.

Jisuanji gongcheng•Jan 1, 2009•1 citation

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

ID-Based Fair Multi-party Exchange Protocol

Minqing Zhang, Haiyan Xiao, Xiaoyuan Yang

Fair multi-party exchange protocol is one of the foundation electronic commerce, but at present, the study of multi-party fair exchange protocol is very weak. Aiming at solving this problem, we present a secure and efficient ID-based fair multi-party exchange protocol with off-line semi-trusted third party. Application of multi-receiver identity-based encryption and PVSS scheme ensure security and efficiency of this new protocol. And it applied to multi-party certified e-mail exchange in network environment.

International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)•Mar 1, 2010•1 citation

Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation

Handan Kılınç Alper, Alptekın Küpçü

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. In particular, we consider MFE scenarios where at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. We analyze the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness , and our protocols preserve the privacy of the exchanged items against the TTP. In the fair SMPC case, we prove that a malicious TTP can only harm fairness, but not security . We construct an asymptotically optimal multi-party fair exchange protocol that requires a constant number of rounds (in comparison to linear) and O(n 2 ) messages (in comparison to cubic), where n is the number of participating parties. In our protocol, we enable the parties to efficiently exchange any item that can be efficiently put into a verifiable encryption (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve fairness with very little overhead (independent of the circuit size). We then generalize our protocol to efficiently handle any exchange topology (participants exchange items with arbitrary other participants). Our protocol guarantees fairness in its strongest sense: even if all n-1 other participants are malicious and colluding with each other, the fairness is still guaranteed.

ACM Transactions on Privacy and Security•Nov 23, 2021•13 citations
A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange electronic items in such a way that everyone gives an item away if and only if it receives an item in return. In this paper, we present a new multi-party fair exchange protocol with an Off-line Semi-Trust Third Party (OSTTP). The new protocol can ensure strong fairness and the OSTTP can't get the exchanged secrets without conspiring with any participants.
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.
The paper proposes a new fair document exchange protocol.In such a fair exchange scenario,each party owns a valuable secret message and they want to exchange their secrets in a fairness way so that at the end of the transaction,either both of them get the other’s secret or neither of them gets the other’s secret.Compared with previous fair exchange protocols,the protocol holds confidentiality,that is,except the two participating party,no one even the Trusted Third Party(TTP) can get exchanged items.
Fair multi-party exchange protocol is one of the foundation electronic commerce, but at present, the study of multi-party fair exchange protocol is very weak. Aiming at solving this problem, we present a secure and efficient ID-based fair multi-party exchange protocol with off-line semi-trusted third party. Application of multi-receiver identity-based encryption and PVSS scheme ensure security and efficiency of this new protocol. And it applied to multi-party certified e-mail exchange in network environment.
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. In particular, we consider MFE scenarios where at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. We analyze the case where a trusted third party (TTP) is optimistically available, although we emphasize that the trust put on the TTP is only regarding the fairness , and our protocols preserve the privacy of the exchanged items against the TTP. In the fair SMPC case, we prove that a malicious TTP can only harm fairness, but not security . We construct an asymptotically optimal multi-party fair exchange protocol that requires a constant number of rounds (in comparison to linear) and O(n 2 ) messages (in comparison to cubic), where n is the number of participating parties. In our protocol, we enable the parties to efficiently exchange any item that can be efficiently put into a verifiable encryption (e.g., signatures on a contract). We show how to apply this protocol on top of any SMPC protocol to achieve fairness with very little overhead (independent of the circuit size). We then generalize our protocol to efficiently handle any exchange topology (participants exchange items with arbitrary other participants). Our protocol guarantees fairness in its strongest sense: even if all n-1 other participants are malicious and colluding with each other, the fairness is still guaranteed.