Fair Identification [chapter]

Omkant Pandey, Julien Cathalo, Jean-Jacques Quisquater
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest then they learn each other's identity, and if anyone is cheating then either both of them learn each other's identity or no one learns no information about the identity of the other. We propose a security model and a provably secure optimistic fair identification protocol.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11605805_4">doi:10.1007/11605805_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xb6khvwbwrftznvpe5zvddswrq">fatcat:xb6khvwbwrftznvpe5zvddswrq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101224170357/http://www.cs.ucla.edu/~omkant/pubs/fid.pdf" 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/3e/16/3e16456464fc0dc6e1e6a0fa032899f42eeb4cf4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11605805_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>