Fair identification

Omkant Pandey; Julien Cathalo; Jean Jacques Quisquater

doi:10.1007/11605805_4

Fair identification

Omkant Pandey
, Julien Cathalo
, Jean Jacques Quisquater

Computer Science

Stony Brook University

UCL Crypto Group

Research output: Contribution to journal › Conference article › peer-review

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.

Original language	English
Pages (from-to)	52-63
Number of pages	12
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3960 LNCS
DOIs	https://doi.org/10.1007/11605805_4
State	Published - 2006
Event	Cryptographers’ Track at the RSA Conference, CT-RSA 2006 - San Jose, CA, United States Duration: Feb 13 2005 → Feb 17 2005

Access to Document

10.1007/11605805_4

Cite this

@article{6ae196c3bb954fd7badc550322bd9389,

title = "Fair identification",

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.",

author = "Omkant Pandey and Julien Cathalo and Quisquater, \{Jean Jacques\}",

year = "2006",

doi = "10.1007/11605805\_4",

language = "English",

volume = "3960 LNCS",

pages = "52--63",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

note = "Cryptographers{\textquoteright} Track at the RSA Conference, CT-RSA 2006 ; Conference date: 13-02-2005 Through 17-02-2005",

}

TY - JOUR

T1 - Fair identification

AU - Pandey, Omkant

AU - Cathalo, Julien

AU - Quisquater, Jean Jacques

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33745646990

U2 - 10.1007/11605805_4

DO - 10.1007/11605805_4

M3 - Conference article

SN - 0302-9743

VL - 3960 LNCS

SP - 52

EP - 63

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - Cryptographers’ Track at the RSA Conference, CT-RSA 2006

Y2 - 13 February 2005 through 17 February 2005

ER -

Fair identification

Abstract

Access to Document

Other files and links

Fingerprint

Cite this