This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Efficient Schnorr Type Identity-Based Blind Signatures from Bilinear Pairings
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Index Terms:
Signatures, Blind Signatures, Identity-Based Signatures, Bilinear Pairings
Citation:
Zhenjie Huang, Qunshan Chen, Rufen Huang, Xuanzhi Lin, "Efficient Schnorr Type Identity-Based Blind Signatures from Bilinear Pairings," csie, vol. 1, pp.130-134, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.