Abstract
As a new paradigm, certificateless public key cryptography was introduced by AI-Riyami and Paterson. It resolves the high cost of certificate in the traditional public key cryptography and the inherent key escrow problem in the identity-based cryptography. Due to the advantages of certificateless public key cryptography, a new efficient certificateless blind signature scheme from bilinear maps is proposed, which requires less computational effort by comparing with previous constructions. The number of pairing operations in the signing and verification phase of our scheme is only one. This is probably the best to achieve in pairing based signature schemes. Furthermore, we show that the proposed scheme is provably secure in the random oracle model. The security of our scheme is proven based on the hardness of q-Strong Diffie-Hellman problem and the Inverse Computational Diffie-Hellman problem.
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.
