Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.156
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 Kim’s schemes in Asiacrypt 2002 and in ACISP 2003.
Signatures, Blind Signatures, Identity-Based Signatures, Bilinear Pairings
Xuanzhi Lin, Qunshan Chen, Rufen Huang, Zhenjie Huang, "Efficient Schnorr Type Identity-Based Blind Signatures from Bilinear Pairings", Computer Science and Information Engineering, World Congress on, vol. 01, no. , pp. 130-134, 2009, doi:10.1109/CSIE.2009.156