Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing

摘要

In the literature, several pairing‐based blind signature schemes have been put forwarded using identity‐based cryptography. However, the private key escrow problem of these schemes makes them unsuitable in practical environments because the private key generator computes signer private key using signer public identity. Therefore, an untrusted/semitrusted private key generator may perform malicious activity on behalf of the signer. We took the advantage of certificateless public key cryptography and constructed a robust and efficient certificateless blind signature (CL‐BS) scheme using bilinear pairing. Furthermore, the probabilistic map‐to‐point hash function, which requires more computation time than the execution time of an elliptic curve scalar point multiplication, is circumvented in our scheme. We found that our scheme is unlinkable and provably secure against the adaptive chosen message and identity adversaries. From the perspective of computational costs, our scheme is more efficient and secure than other related schemes. Copyright ? 2015 John Wiley & Sons, Ltd. The proposed certificateless blind signature scheme is designed based on the bilinear pairing. The probabilistic map‐to‐point hash function is not used in the proposed scheme. The proposed scheme is unlinkable and provably secure in the random oracle model.