Abstract
The cost of pairing computation is much more than the cost of computing scalar multiplication over elliptic curve group. Hence, the bilinear pairing based digital signature are less practical in the applications where short signature length as well as fast signature generation and verification are required. For such type of applications, we present a pairing computation free efficient and secure short identity (ID)-based signature scheme over elliptic curve. The proposed signature scheme is unforgeable in ROM against existential forgery on adaptive chosen message and ID attack with the assumption that ECDLP is hard in G. Moreover, the proposed signature scheme uses general cryptographic hash function in spite of costly map-to-point hash function and the comparative performance analysis shows that the proposed scheme is much more efficient, secure and short in signature length from related ID-based signature schemes
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.
