Partially blind signature allows a signer to explicitly embed a pre-agreed common information into a blind signature without the loss of blindness property. It overcomes the defects of the completely blind signature and the limited blind signature. For the problem of low efficiency and security common in present ID-based partially blind signature schemes, a new efficient and secure ID-based partially blind signature scheme was proposed. Utilizing the Chosen-Target Accompanied Computational Diffie-Hellman (CT-ACDH) assumption and effective precomputation, not only made the scheme possess the unforgeability for adapting chosen-message and identity attacks in the random oracle model, but also reduced the whole computational complexity. Compared with the existing ID-based partially blind signature schemes in the random oracle model, the proposed scheme has the best efficiency, and compared with the Chow's scheme (CHOW S,HUI L,YIU S. Two improved partially blind signature schemes from bilinear pairings［C］// Proceedings of ACISP'05. Berlin: Springer-Verlag,2005:316-328.) and He's one(HE J,SUN F,QI C. Cryptanalysis and improvement of ID-based partially blind signature scheme［J］.Journal of Computer Applications,2013,33(3):762-765.), the computational efficiency is increased by about 64.1% and 13.2% respectively. Hence, the scheme can enhance the efficiency and safety of electronic voting and electronic cash systems, etc.
