Symmetry

A Generic Framework for Accountable Optimistic Fair Exchange Protocol

Jia-Chng Loh, Swee‐Huay Heng, Syh‐Yuan Tan

Published Feb 22, 2019• 3 citations

Abstract

Optimistic Fair Exchange protocol was designed for two parties to exchange in a fair way where an arbitrator always remains offline and will be referred only if any dispute happens. There are various optimistic fair exchange protocols with different security properties in the literature. Most of the optimistic fair exchange protocols satisfy resolution ambiguity where a signature signed by the signer is computational indistinguishable from the one resolved by the arbitrator. Huang et al. proposed the first generic framework for accountable optimistic fair exchange protocol in the random oracle model where it possesses resolution ambiguity and is able to reveal the actual signer when needed. Ganjavi et al. later proposed the first generic framework in the standard model. In this paper, we propose a new generic framework for accountable optimistic fair exchange protocol in the standard model using ordinary signature, convertible undeniable signature, and ring signature scheme as the underlying building blocks. We also provide an instantiation using our proposed generic framework to obtain an efficient pairing-based accountable optimistic fair exchange protocol with short signature.

DOI: 10.3390/sym11020285

Related papers

A generic framework for accountable Optimistic Fair Exchange protocol

Jia-Chng Loh, Heng, SH, Tan, SY

SymmetryJan 1, 20250 citations

An ambiguous optimistic fair exchange protocol with traceability

Ramin Ganjavi, Maryam Rajabzadeh Asaar, Mahmoud Salmasizadeh

An Optimistic fair exchange (OFE) protocol is a protocol for fairly exchanging items between two parties. First in 2008, Huang et al. introduced the concept of ambiguous OFE in which the partial signature is ambiguous but the full one is not. Qu et al. in 2012, proposed a shceme with ambiguity for the full signature but not for the partial one. We solve the problem of both schemes by proposing the first efficient protocol that has ambiguity in both partial and full signature. Meanwhile, by using a traceable ring signature (TRS), we achieve the accountability property. We should highlight that our accountable OFE protocol is the first one secure in the standard model.

International Symposium on TelecommunicationsSep 1, 20142 citations

Efficient Fair Exchange from Identity-Based Signature

Dae Hyun Yum, Pil Joong Lee

A fair exchange scheme is a protocol by which two parties Alice and Bob exchange items or services without allowing either party to gain advantages by quitting prematurely or otherwise misbehaving. To this end, modern cryptographic solutions use a semi-trusted arbitrator who involves only in cases where one party attempts to cheat or simply crashes. We call such a fair exchange scheme optimistic. When no registration is required between the signer and the arbitrator, we say that the fair exchange scheme is setup free. To date, the setup-free optimist fair exchange scheme under the standard RSA assumption was only possible from the generic construction of [12], which uses ring signatures. In this paper, we introduce a new setup-free optimistic fair exchange scheme under the standard RSA assumption. Our scheme uses the GQ identity-based signature and is more efficient than [12]. The construction can also be generalized by using various identity-based signature schemes. Our main technique is to allow each user to choose his (or her) own “random” public key in the identitybased signature scheme.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20088 citations

Revisiting Optimistic Fair Exchange Based on Ring Signatures

Yang Wang, Man Ho Au, Willy Susilo

Optimistic fair exchange (OFE) is a kind of protocol that solves the fair exchange problem with the help of a trusted third party, usually referred to as an arbitrator. Participation of the arbitrator is required only when there is a dispute among the exchanging parties. Thus, the majority of the executions of the exchange does not involve the arbitrator and hence the term optimistic. The passive nature of the arbitrator makes optimistic fair exchange a desirable tool in applications, such as contract signing and electronic commerce. The highest level of security of optimistic fair exchange in the literature is the multiuser security in the chosen-key model, proposed by Huang, Yang, Wong, and Susilo in CT-RSA 2008. They showed that an efficient optimistic fair exchange scheme secure in this sense can be constructed generically from a conventional digital signature and a two-party ring signature. In particular, the underlying ring signature is required to be unforgeable under an adaptive attack, against a static adversary in the 2-user setting. In this paper, we propose a new security model for two-party ring signatures called unforgeability against restricted adaptive attacks and demonstrate that our new model is strictly weaker than the model of unforgeable under an adaptive attack, against a static adversary in the 2-user setting. We make an observation that two-party ring signatures secure in this weaker model will suffice to guarantee the security of the resulting OFE scheme following the aforementioned generic construction. Based on this observation, more efficient OFE schemes secure in the standard model can be constructed. Specifically, we prove that the well-known Bender, Katz, and Morselli's 2-user ring signature is secure in our weakened model. Based on this two-party ring signature, we construct an OFE secure in the chosen-key model offering multiuser security in the standard model under the computational Diffie-Hellman assumption. The assumption is arguably weaker than those used in all existing constructions, which rely on the random oracle model, decisional assumptions, or the strong Diffie-Hellman assumptions. It is also worth noting that our scheme is the most efficient one in the standard model, and offers comparable efficiency against those secure under the random oracle model.

IEEE Transactions on Information Forensics and SecuritySep 17, 20141 citation

Generic Construction of Privacy-Preserving Optimistic Fair Exchange Protocols.

Qingwen Guo, Yuzhao Cui, Xiaomeng Zou +1 more

Privacy-preserving optimistic fair exchange (P2OFE) is a kind of protocols which aim to solve the fairness problem in the exchange of digital signatures between two parties and in the meanwhile protect their privacy. In P2OFE, no one else including the semi-trusted third party in charge of arbitration can confirm an exchange even after resolving a dispute. In this paper we present a black-box construction of P2OFE based on a tag-based public key encryption scheme and a standard digital signature scheme. Our construction follows the ‘sign-then-encrypt’ paradigm, and is secure in the standard model. Our construction is generic and admits more instantiations of P2OFE.

Journal of Internet Services and Information SecurityJan 1, 20173 citations

Constructing Optimistic Fair Exchange Protocols from Committed Signatures.

Huafei Zhu

In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having cosigner store a piece of prime signer's secret key. Dodis and Reyzin [20] showed that the protocol in [32] is totally breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model, by utilizing Boldyreva non-interactive two-party multi-signature scheme [8]. Security in the random oracle model does not imply security in the real world. In this paper, we provide the first two e#cient committed signatures which are provably secure in the standard complexity model from strong RSA assumption. Then we construct e#cient optimistic fair exchange protocols from those new primitives.

Jan 1, 20034 citations