Paper 2005/336

Pairing-based identification schemes

David Freeman

Abstract

We propose four different public-key identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or more secure than any known pairing-based identification scheme.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
identification schemepairingselliptic curveszero-knowledge proof of identity
Contact author(s)
dfreeman @ math berkeley edu
History
2005-09-27: received
Short URL
https://ia.cr/2005/336
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/336,
      author = {David Freeman},
      title = {Pairing-based identification schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2005/336},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/336}},
      url = {https://eprint.iacr.org/2005/336}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.