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.
Highlights
A fair exchange protocol was first designed to overcome the issue of fairness during an exchange between two parties such as contract signing [1,2], digital exchange [3], certified mail [4,5,6], etc
We select the short signature scheme proposed by Boneh et al [30] as the ordinary signature scheme with the combination of convertible undeniable signature scheme proposed by Li et al [31] and ring signature scheme proposed by Shim [32], we manage to obtain an efficient pairing-based accountable optimistic fair exchange (OFE) protocol with short signature
Let A be the probabilistic polynomial time (PPT) adversary which (t, q PSign, qSign, q Res, q Prove A, q ProveU, ε)-breaks the type I accountability, we build a PPT algorithm D which runs A as a subroutine and (t, q PSign, qSign, q Res, q Prove A, q ProveU, ε)-breaks the existential unforgeable against chosen message attack (EUF-CMA) and the completeness and soundness of the underlying convertible undeniable signature scheme with the success probability more than ε in its game with at most q PSign queries to O PSign, qSign queries to OSign, q Res queries to O Res, q Prove A queries to O Prove A, and q ProveU queries to O ProveU in time t
Summary
Faculty of Information Science and Technology, Multimedia University, Melaka 75450, Malaysia. This paper is an extended version of our paper published in Su C., Kikuchi H. ISPEC 2018, held in Tokyo, Japan, in September 2018. Springer, Cham, Switzerland, 2018; Volume 11125, pp. Received: 18 December 2018; Accepted: January 2019; Published: February 2019
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
