Pairing-based identification schemes
arXiv:cs/0509056
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.