Quasi-Efficient Revocation of Group Signatures

  • Giuseppe Ateniese
  • Dawn Song
  • Gene Tsudik
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2357)


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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ACJT]
    G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A Practical & Provably Secure Coalition-Resistant Group Signature Scheme In Advances in Cryptology — CRYPTO’ 00, Springer-Verlag, 2000.Google Scholar
  2. [CP95]
    L. Chen and T. P. Pedersen. New group signature schemes. In Advances in Cryptology — EUROCRYPT’ 94, vol. 950 of LNCS, pp. 171–181, 1995.CrossRefGoogle Scholar
  3. [CS97]
    J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology — CRYPTO’ 97, vol. 1296 of LNCS, pp. 410–424, Springer-Verlag, 1997.CrossRefGoogle Scholar
  4. [Stad96]
    M. Stadler. Publicly Verifiable Secret Sharing, In Advances in Cryptology — EUROCRYPT’ 96, Springer-Verlag, 1996.Google Scholar
  5. [Cam98]
    J. Camenisch. Group signature schemes and payment systems based on the discrete logarithm problem. PhD thesis, vol. 2 of ETH Series in Information Security an Cryptography, Hartung-Gorre Verlag, Konstanz, 1998. ISBN 3-89649-286-1.Google Scholar
  6. [CvH91]
    D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology — EUROCRYPT’ 91, vol. 547 of LNCS, pp. 257–265, Springer-Verlag, 1991.Google Scholar
  7. [KP98]
    J. Kilian and E. Petrank. Identity escrow. In Advances in Cryptology — CRYPTO’ 98, vol. 1642 of LNCS, pp. 169–185, Springer-Verlag, 1998.CrossRefGoogle Scholar
  8. [LR98]
    A. Lysyanskaya and Z. Ramzan. Group blind digital signatures: A scalable solution to electronic cash. In Financial Cryptography (FC’ 98), vol. 1465 of LNCS, pp. 184–197, Springer-Verlag, 1998.CrossRefGoogle Scholar
  9. [CS98]
    R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology — CRYPTO’ 98, vol. 1642 of LNCS, pp. 13–25.CrossRefGoogle Scholar
  10. [AT99a]
    G. Ateniese and G. Tsudik. Group Signatures a’ la Carte. In Proceedings of 1999 ACM Symposium on Discrete Algorithms, ACM Press, 1999.Google Scholar
  11. [AT99]
    G. Ateniese and G. Tsudik. Some open issues and new direction in group signatures. In Proceedings of 1999 Financial Crypto. Springer-Verlag, 1999.Google Scholar
  12. [BS2000]
    E. Bresson and J. Stern. Efficient Revocation in Group Signatures, In Proceedings of Public Key Cryptography (PKC2001), Springer-Verlag, 2001.Google Scholar
  13. [Song01]
    D. Song. Practical Forward-Secure Group Signature Schemes. In Proceedings of 2001 ACM Symposium on Computer and Communication Security. November 2001.Google Scholar
  14. [Cam97]
    J. Camenisch. Efficient and Generalized Group Signatures. In Advances in Cryptology-EUROCRYPT’ 97, vol. 1233 of LNCS, pp. 465–479, Springer Verlag, 1997Google Scholar
  15. [CM98a]
    J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In Advances in Cryptology — ASIACRYPT’ 98, vol. 1514 of LNCS, pp. 160–174, Springer-Verlag, 1998.Google Scholar
  16. [CL02]
    J. Camenisch and A. Lysyanskaya. Efficient revocation of anonymous group membership certificates and anonymous credentials. IACR eprint archive n. 2001/113.Google Scholar

Copyright information

© IFCA/Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Giuseppe Ateniese
    • 1
  • Dawn Song
    • 2
  • Gene Tsudik
    • 3
  1. 1.Department of Computer ScienceThe Johns Hopkins UniversityBaltimoreUSA
  2. 2.Computer Science Division, EECSUniversity of CaliforniaBerkeleyUSA
  3. 3.Department of Information and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations