English

Pairing-based identification schemes

Cryptography and Security 2007-05-23 v1

Abstract

We propose four different 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.

Cite

@article{arxiv.cs/0509056,
  title  = {Pairing-based identification schemes},
  author = {David Freeman},
  journal= {arXiv preprint arXiv:cs/0509056},
  year   = {2007}
}