Abstract
Identification protocols have a very important role in the world of electronic communication. In an identification protocol, the prover (user) proves to the verifier (center) that it is truly the authorized user who is communicating with the center. In one round of batch identification scheme a user with several secret keys (identities) can prove itself to the verifier instead of several proofs. In this paper, the first Weil pairing will be introduced. In addition, we propose a new batch zero-knowledge identification scheme based on the Weil pairing hereafter considered the security analysis of our proposed scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
