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)
Efficient Partially Blind Signature from LFSR
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
Zheng Gong, Shanghai Jiaotong University, China; Graduate School of Chinese Academy of Sciences, China
Yu Long, Shanghai Jiaotong University, China
Kefei Chen, Shanghai Jiaotong University, China
In this paper, we provide a new partially blind signature scheme which is based on n-th order characteristic sequences generated by LFSR, and then prove its security in the random oracle model (ROM). Compares with the finite field based schemes, our scheme shows advantages on the computation and storage since the reduced representation of finite field elements by LFSR. It will make those applications more efficient in hardware-limited environments, such as cellular networks, tactical networks and sensor nets.
Citation:
Zheng Gong, Yu Long, Kefei Chen, "Efficient Partially Blind Signature from LFSR," snpd, vol. 2, pp.717-722, 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.