You are looking at a specific version 20050927:145439 of this paper.
See the latest version.
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)
- 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
-
CC BY