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)
A New Threshold Group Signature Scheme Based on Discrete Logarithm Problem
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
Fengyin Li, The Qufu Normal University, China
Jiguo Yu, The Qufu Normal University, China
Hongwei Ju, The Qufu Normal University, China
The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, based on the discrete logarithm problem and the group signature model of Camenisch and Groth [6], a secure threshold group signature scheme is proposed. The scheme is not only threshold-signing, but also threshold-verifying. Performances analysis shows that it can not only satisfy the properties of threshold group signatures , but also withstand the conspiracy attack.
Citation:
Fengyin Li, Jiguo Yu, Hongwei Ju, "A New Threshold Group Signature Scheme Based on Discrete Logarithm Problem," snpd, vol. 3, pp.1176-1182, 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.