arXiv · cs/0509056
Pairing-based identification schemes
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.
Explore related subjects
Keep this discovery
David Freeman. 2005-09-19. Pairing-based identification schemes. https://arxiv.org/abs/cs/0509056
Cite the original work for its findings. Save a collection to share your selection of sources.