Abstract
Due to eliminating the inherent key escrow in identity-based cryptosystem,the certificateless public key cryptosystem came into being.A new efficient certificateless signature scheme based on bilinear pairing was put forward.The signing algorithm did not need any pairing computation but need one exponentiation computation,and the verification algorithm only needed one pairing and one exponentiation computation.The new scheme is more efficient than other exsiting schemes in terms of computation overhead.Furthermore,the security relies on the hardness of the q-Strong Diffie-Hellman(q-SDH) problem and Inverse-Compute Diffie-Hellman(Inv-CDH) problem.Under the random oracle model,the new scheme is proved to be secure against existential forgery on adaptively chosen message attack.
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.
