An Efficient Dynamic Group Signatures Scheme with CCA-Anonymity in Standard Model

摘要

Group signatures is a cryptographic primitive, simultaneously supporting anonymity and traceability. Though many group signatures schemes have been presented, some drawbacks still exist in these schemes at the aspects of security, performance and functionality. In order to overcome these issues, this paper proposes a new dynamic group signatures scheme with CCA-anonymity, allowing the members enroll the group dynamically. By making use of the Groth-Sahai proof system and verifiable encryption technologies, this paper constructs the scheme in detailed under the decisional linear assumption and q-strong diffie-hellman assumption. And in standard model, we prove our scheme meet CCA-anonymity, traceability and non-frameability. Finally, compared with other existing group signatures schemes, the proposed scheme is more secure and efficient on both the computation cost and communication cost.