Financial Cryptography

Volume 2357 of the series Lecture Notes in Computer Science pp 183-197

Quasi-Efficient Revocation of Group Signatures

  • Giuseppe AtenieseAffiliated withDepartment of Computer Science, The Johns Hopkins University
  • , Dawn SongAffiliated withComputer Science Division, EECS, University of California
  • , Gene TsudikAffiliated withDepartment of Information and Computer Science, University of California

* Final gross prices may vary according to local VAT.

Get Access


Several interesting group signature schemes have been proposed to-date. However, in order for the entire group signature concept to become practical and credible, the problem of secure and efficient group member revocation must be addressed. In this paper, we construct a new revocation method for group signatures based on the signature scheme by Ateniese et al. [ACJT]. This new method represents an advance in the state-of-the-art since the only revocation schemes proposed thus far are either: 1) based on implicit revocation and the use of fixed time periods, or 2) require the signature size to be linear in the number of revoked members. Our method, in contrast, does not rely on time periods, offers constant-length signatures and constant work for the signer.


Group signatures revocation of group membership credentials dynamic groups