Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

摘要

Based an identity-based signature scheme, we give a certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This scheme is more efficient than those of previous schemes by pre-computing the pairing e(P, P) = g. Based on CL-PKC, it eliminates the using of certificates in the signature scheme with respect to the traditional public key cryptography (PKC) and solves key escrow problems in ID-based signature schemes. Meanwhile it retains the merits of BS schemes. The proposed CLBS scheme is existential unforgeable in the random oracle model under the intractability of the q-Strong Diffie-Hellman problem.