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

Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles

Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo

Published Apr 4, 2008• 49 citations
Publisher
DOI
10.1007/978-3-540-79263-5_7

Related papers

A new efficient optimistic fair exchange protocol without random oracles

Qiong Huang, Guomin Yang, Duncan S. Wong +1 more

International Journal of Information Security•Dec 1, 2011•9 citations

Optimistic Fair Exchange in a Multi-user Setting

Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum

Springer eBooks•Jun 20, 2007•79 citations

Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting

Xinyi Huang, Yi Mu, Willy Susilo +2 more

Lecture notes in computer science•Jan 1, 2010•9 citations

Optimistic fair exchange in the enhanced chosen-key model

Yang Wang, Man Ho Au, Willy Susilo

Theoretical Computer Science•Sep 21, 2014•2 citations

Efficient ID-Based Optimistic Fair Exchange with Provable Security

Zhenfeng Zhang, Dengguo Feng, Jing Min Xu +1 more

Lecture notes in computer science•Jan 1, 2005•11 citations

A traceable optimistic fair exchange protocol

Ramin Ganjavi, Maryam Rajabzadeh Asaar, Mahmoud Salmasizadeh

An Optimistic fair exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol, both of them receive their items or none of them receives anything. In 2008, Huang et al. presented an efficient OFE protocol, but there is a security problem in their scheme. If the trusted third party (TTP) is dishonest and colludes with the verifier, the TTP can complete the transaction without getting signer's agreement. To solve this problem, we propose an OFE protocol in which there is a tracing algorithm to detect the party who completes the transaction. Furthermore, we obtain the accountability property introduced by Huang et al. in 2011, more efficiently and in the standard model while their protocol is in the random oracle model. We prove the security of our scheme under the chosen-key model and multi-user setting in the standard model.

International ISC Conference on Information Security and Cryptology (ISCISC)•Sep 1, 2014•2 citations
An Optimistic fair exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol, both of them receive their items or none of them receives anything. In 2008, Huang et al. presented an efficient OFE protocol, but there is a security problem in their scheme. If the trusted third party (TTP) is dishonest and colludes with the verifier, the TTP can complete the transaction without getting signer's agreement. To solve this problem, we propose an OFE protocol in which there is a tracing algorithm to detect the party who completes the transaction. Furthermore, we obtain the accountability property introduced by Huang et al. in 2011, more efficiently and in the standard model while their protocol is in the random oracle model. We prove the security of our scheme under the chosen-key model and multi-user setting in the standard model.