Paper 2001/101 Original: eprint.iacr.org/2001/101 ↗

Quasi-Efficient Revocation of Group Signatures

Giuseppe Ateniese
Dawn Song
Gene Tsudik
Abstract

A group signature scheme allows any group member to sign on behalf of the group in an anonymous and unlinkable fashion. In the event of a dispute, a designated trusted entity can reveal the identity of the signer. Group signatures are claimed to have many useful applications such as voting and electronic cash. A number of group signature schemes have been proposed to-date. However, in order for the whole 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. at Crypto 2000. 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2002-04-02: last updated
2001-11-21: published
Short URL
https://ia.cr/2001/101
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2001/101,
      author = {Giuseppe Ateniese and Dawn Song and Gene Tsudik},
      title = {Quasi-Efficient Revocation of Group Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2001/101},
      year = {2001},
      url = {https://eprint.iacr.org/2001/101}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.