Quasi-efficient revocation of group signatures

Giuseppe Ateniese, Dawn Song, Gene Tsudik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

110 Scopus citations

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.

Original languageEnglish
Title of host publicationFinancial Cryptography - 6th International Conference, FC 2002, Revised Papers
EditorsMatt Blaze
Pages183-197
Number of pages15
DOIs
StatePublished - 2003
Event6th International Financial Cryptography Conference, FC 2002 - Southampton, Bermuda
Duration: 11 Mar 200214 Mar 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2357
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Financial Cryptography Conference, FC 2002
Country/TerritoryBermuda
CitySouthampton
Period11/03/0214/03/02

Keywords

  • Dynamic groups
  • Group signatures
  • Revocation of group membership credentials

Fingerprint

Dive into the research topics of 'Quasi-efficient revocation of group signatures'. Together they form a unique fingerprint.

Cite this