loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)
An Efficient ID-Based Restrictive Partially Blind Signature Scheme
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
Xiaoming Hu, Shanghai Jiao Tong University, China
Shangteng Huang, Shanghai Jiao Tong University, China
Many restrictive partially blind signatures have been proposed till now. But all existing restrictive partially blind signature schemes were constructed under certificate-based public key systems. Recently, Chen et al. proposed the first ID-based restrictive partially blind signature from bilinear pairings. However, the computational cost of their scheme is high. In this paper, we propose a new ID-based restrictive partially blind signature scheme. We analyze its efficiency and security. We claim that our scheme is simpler and more efficient than Chen et al.?s scheme. It also is provably secure in the random oracle model.
Citation:
Xiaoming Hu, Shangteng Huang, "An Efficient ID-Based Restrictive Partially Blind Signature Scheme," snpd, vol. 3, pp.205-209, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.