Since certificateless public key cryptosystem can solve the complex certificate management problem in the traditional public\nkey cryptosystem and the key escrow problem in identity-based cryptosystem and the pairing computation is slower than scalar\nmultiplication over the elliptic curve, how to design certificateless signature (CLS) scheme without bilinear pairings is a challenge.\nIn this paper, we first propose a new pairing-free CLS scheme, and then the security proof is presented in the random oracle model\n(ROM) under the discrete logarithm assumption. The proposed scheme is more efficient than the previous CLS schemes in terms\nof computation and communication costs and is more suitable for the applications of low-bandwidth environments.
Loading....