Fair Identification

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.

• Type: Conference
• Year: 2006
• Where: CTRSA
• Authors: Omkant Pandey, Julien Cathalo, Jean-Jacques Quisquater
• Keywords: Cryptology, CTRSA 2006, Fair Identification, Fair Manner, Other's Identity