Cryptology ePrint Archive: Report 2007/479

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

J. Wu and 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.

Category / Keywords: cryptographic protocols / identification protocols

Date: received 20 Dec 2007, last revised 15 May 2008

Contact author: j32wu at cs uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20080515:133041 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]