A new efficient optimistic fair exchange protocol without random oracles
Abstract
No abstract recorded for this item.
No abstract recorded for this item.
Optimistic fair exchange is a kind of protocols to solve the problem of fair exchange between two parties. Almost all the previous work on this topic are provably secure only in the random oracle model. In PKC 2007, Dodis et al. considered optimistic fair exchange in a multiuser
Fair exchange protocols allow both or neither of two parties to obtain the other’s items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by prescribing three forms of signa
Recent research has shown that the single-user security of optimistic fair exchange cannot guarantee the multi-user security. This paper investigates the conditions under which the security of optimistic fair exchange in the single-user setting is preserved in the multi-user sett
For e-commerce payments, fair exchange is one of the essential problems. The optimistic fair exchange protocol allows two parties to efficiently exchange items so that either each party gets the other’s item or neither does. We propose a new optimistic fair exchange protocol that
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 execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted thi
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 execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted thi