Efficient group signature scheme based on the discrete logarithm

摘要

Group signatures, introduced by D. Chaum and E. Van Heyst (1991), allow individual members to make signatures on behalf of the group while providing anonymity. All previously proposed schemes, as far as we know, are not very efficient in terms of computational, communication and storage costs. In the paper, we describe a novel group signature that is used to reflect and project the actual needs arising from practical applications. This new scheme is very efficient compared to previous results. The security of the newly proposed scheme is based on the discrete logarithm problem.