Quasi-Efficient Revocation of Group Signatures

  • Giuseppe Ateniese
  • Dawn Song
  • Gene Tsudik
Conference paper

DOI: 10.1007/3-540-36504-4_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2357)
Cite this paper as:
Ateniese G., Song D., Tsudik G. (2003) Quasi-Efficient Revocation of Group Signatures. In: Blaze M. (eds) Financial Cryptography. FC 2002. Lecture Notes in Computer Science, vol 2357. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

Group signatures revocation of group membership credentials dynamic groups 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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