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

Lecture notes in computer science

Exclusion-Freeness in Multi-party Exchange Protocols

Nicolás Gonzaléz-Deleito, Olivier Markowitch

Published Jan 1, 2002• 15 citations
Publisher
DOI
10.1007/3-540-45811-5_15

Related papers

Formal analysis and design of multi-party fair exchange protocols

Sihan Qing, LI Gai-cheng

Science in China Series F Information Sciences•Apr 1, 2006•0 citations

Identity-based fair multi-party exchange protocol

Mei-mei FAN, Changgen Peng

Journal of Computer Applications•Apr 7, 2009•1 citation

Multi-party Fair Exchange Protocol Using Ring Architecture Model

Insoo Khill, Jiseon Kim, Ingoo Han +1 more

Computers & Security•Jul 1, 2001•23 citations

Chameleon-Based Optimistic Fair Exchange Protocol

Xuan Yang, Zhaoping Yu, Bin Kang

A fair exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item or neither party does. In this paper, we propose a key-exposure-free chameleon hashing scheme based on the discrete logarithm assumption, and prove that it enjoys all advantages of previous schemes: collision resistant, semantic security, message hiding and key exposure freeness. Using this new scheme as kernel, an efficient and secure chameleon-based optimistic fair exchange protocol is proposed. Unlike the vast majority of previously proposed protocols, above approach has no use for verifiably encrypted signature and does not use any zero knowledge proofs, which avoids most of the costly computations. The security of the newly devised protocol is also examined. It is showed that the proposed scheme is secure and efficient.

International Conference on Embedded Software and Systems•Jan 1, 2008•5 citations

On Fairness in Exchange Protocols

Olivier Markowitch, Dieter Gollmann, Steve Kremer

Lecture notes in computer science•Jan 1, 2003•36 citations

An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature

Guilin Wang

A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in afairway, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property-abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract-signing protocol based on the RSA signature, and show that it is both secure and efficient.

IEEE Transactions on Information Forensics and Security•Nov 13, 2009•50 citations
A fair exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item or neither party does. In this paper, we propose a key-exposure-free chameleon hashing scheme based on the discrete logarithm assumption, and prove that it enjoys all advantages of previous schemes: collision resistant, semantic security, message hiding and key exposure freeness. Using this new scheme as kernel, an efficient and secure chameleon-based optimistic fair exchange protocol is proposed. Unlike the vast majority of previously proposed protocols, above approach has no use for verifiably encrypted signature and does not use any zero knowledge proofs, which avoids most of the costly computations. The security of the newly devised protocol is also examined. It is showed that the proposed scheme is secure and efficient.
A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in afairway, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property-abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract-signing protocol based on the RSA signature, and show that it is both secure and efficient.