Efficient certificateless signature scheme based on bilinear parings
Ya-ning HAN · Journal of Computer Applications · 2009
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.