Efficient Schnorr Type Identity-Based Blind Signatures from Bilinear Pairings

Identity-based cryptosystem has a property that a user's public key can be easily calculated from his identity by a publicly available function, and can be hence a good alternative for certificate-based public key infrastructure. Blind signature has the anonymity and plays a central role in applications such as electronic voting and electronic cash systems. In this paper, we propose three efficient Schnorr type identity-based blind signature schemes based on bilinear pairings. Efficiency analysis shows that our schemes are far more efficient than Zhang and Kimpsilas schemes in Asiacrypt 2002 and in ACISP 2003.