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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
