Abstract
An ID-based cryptographic scheme enables the user to public keys without exchanging public key certificates. In these schemes, users can generate their public and private keys using their identity. The positive application of bilinear pairings over elliptic curves makes the system easy and efficient in providing security. In this paper, we propose an ID-based signature scheme using bilinear pairings. We prove that the proposed signature scheme is secure against existential forgery under adaptively chosen message and ID attack in the random oracle model with the assumption that the computational Diffie-Hellman problem is intractable. We compare the efficiency of the proposed scheme with some related ID-based signature schemes.
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.
