Efficient group signature scheme based on modification of DSA

Previously proposed realizations of group signature schemes had the undesirable property that the length of the public key was linear in the size of the group and therefore also the running time of the verification algorithm depended on the number of group members. A new group signature schemes would be proposed, which could overcome these problems. Furthermore, the scheme allowed the group manager to add new members to the group without modifying the public key. The realization was based on the knowledge of signature of a modification of DSA.