A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://ro.uow.edu.au/cgi/viewcontent.cgi?article=9342&context=infopapers">the original URL</a>. The file type is <code>application/pdf</code>.
A new efficient optimistic fair exchange protocol without random oracles
<span title="2011-12-01">2011</span>
<i title="Springer Nature">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pmp3fe6mtncjnmxpkeavdxh6sm" style="color: black;">International Journal of Information Security</a>
</i>
Preserved Fulltext
Optimistic fair exchange (OFE) is a kind of protocols to solve the problem of fair exchange between two parties. Most of the previous work on this topic are provably secure in the random oracle model. In this work, we propose a new construction of OFE from another cryptographic primitive, called time capsule signature. The construction is efficient and brings almost no overhead other than the primitive itself. The security of our new construction is based on that of the underlying primitive
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10207-011-0152-3">doi:10.1007/s10207-011-0152-3</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mso42x255fedhffwoo2zxd7mom">fatcat:mso42x255fedhffwoo2zxd7mom</a>
</span>
more »
... out relying on the random oracle heuristic. Applying our generic construction to the time capsule signature scheme recently proposed by Libert and Quisquater, we obtain a new concrete and efficient OFE construction secure based on Computational Diffie-Hellman assumption in the standard model. Abstract Optimistic fair exchange (OFE) is a kind of protocols to solve the problem of fair exchange between two parties. Most of the previous work on this topic are provably secure in the random oracle model. In this work we propose a new construction of OFE from another cryptographic primitive, called time capsule signature. The construction is efficient, and brings almost no overhead other than the primitive itself. The security of our new construction is based on that of the underlying primitive without relying on the random oracle heuristic. Applying our generic construction to the time capsule signature scheme recently proposed by Libert and Quisquater, we obtain a new concrete and efficient OFE construction secure based on Computational Diffie-Hellman assumption in the standard model.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430015928/https://ro.uow.edu.au/cgi/viewcontent.cgi?article=9342&context=infopapers" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/16/ad/16adc7878540100f3ba8c1f60be9740338ba0b17.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10207-011-0152-3">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>