Certificate-based blind signatures from bilinear pairings

Certificate-based public key cryptography was introduced to remove the use of certificate to ensure the authentication of the user´s public key in the traditional public key cryptography and to overcome the key escrow problem in the identity-based public key cryptography. Blind signature has the anonymity and plays a central role in applications such as electronic voting and electronic cash systems. Combining the concept of certificate-based cryptography with the concept of blind signature, in this paper, we propose an efficient certificate-based blind signature scheme assuming the hardness of Computational Diffie-Hellman Problem.