Fair identification

  • Authors:
  • Omkant Pandey;Julien Cathalo;Jean-Jacques Quisquater

  • Affiliations:
  • Department of Computer Science, UCLA;UCL Crypto Group, Belgium;UCL Crypto Group, Belgium

  • Venue:
  • CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.