Efficient certificateless signature and blind signature schemes

This paper studied blind signatures in the certificateless public key setting,and put forward an efficient construction of certificateless blind signature scheme using bilinear maps.It was based on a certificateless signature scheme.Then proved the certificateless signature scheme secure in the random oracle models with the assumption that the computational Diffie-Hellman problem was infeasible.Due to its security,high efficiency and free of certificate management,the certificateless blind signature scheme have practical applications in electronic voting and electronic cash,etc.