Pairing-based identification schemes
classification
💻 cs.CR
keywords
identificationschemespairing-basedassumptionsbilinearcertaincomputationaldifferent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.