DocumentCode
2315693
Title
ACJT Group Blind Signature Scheme
Author
Zhong, Jun ; He, Dake
Author_Institution
Sch. of Inf. Sci. & Technol., Southwest Jiaotong Univ., Chengdu
fYear
2006
fDate
25-27 Oct. 2006
Firstpage
1
Lastpage
6
Abstract
This paper constructs a new group blind signature scheme on the basis of ACJT group signature scheme. The security of the new scheme is based on the strong RSA assumption and the decisional Diffie-Hellman assumption of which is different from the scheme of LR98. In the mean time, the efficiency of the user to blind the content of the signer is improved. To blind the group signature of ACJT, this paper only adds the computation of modular exponentiation and modular addition; while the scheme in LR98 adds the computation of double discreet logarithm, root of the discreet logarithm and random permutation in order to blind the group signature of CS97. As a result, the scheme proposed by this paper is much lower than the one in LR98 with respect to computation complexity and higher with respect to efficiency.
Keywords
computational complexity; digital signatures; ACJT group blind signature scheme; CS97; LR98; computation complexity; decisional Diffie-Hellman assumption; double discreet logarithm; modular addition; modular exponentiation; random permutation; strong RSA assumption; Contracts; Digital signatures; Helium; Identity management systems; Information science; Information security; Modems; Public key; Group Blind Signature; Group Signature; Information Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Networking in China, 2006. ChinaCom '06. First International Conference on
Conference_Location
Beijing
Print_ISBN
1-4244-0463-0
Electronic_ISBN
1-4244-0463-0
Type
conf
DOI
10.1109/CHINACOM.2006.344757
Filename
4149974
Link To Document