Paper 2007/479 Original: eprint.iacr.org/2007/479 ↗

An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption

J. Wu
D. R. Stinson
Abstract

In this paper, we propose an extremely simple identification protocol and prove its security using the Knowledge-of-Exponent Assumption (KEA). We discuss the applicability of KEA in various protocol settings as well. Recently, doubts have been raised about applying KEA in some protocols where an adversary has auxiliary inputs. However, we suggest that KEA is applicable in these cases. We present two variants of KEA, Generalized KEA (GKEA) and Auxiliary-Input KEA (AI-KEA), to clarify the proper use of KEA.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2008-05-15: last updated
2007-12-28: published
Short URL
https://ia.cr/2007/479
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2007/479,
      author = {J.  Wu and D. R.  Stinson},
      title = {An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/479},
      year = {2007},
      url = {https://eprint.iacr.org/2007/479}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.