Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / identification scheme, pairings, elliptic curves, zero-knowledge proof of identity

Date: received 19 Sep 2005

Contact author: dfreeman at math berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20050927:145439 (All versions of this report)

Short URL: ia.cr/2005/336

Discussion forum: Show discussion | Start new discussion