Quasi-Efficient Revocation in Group Signatures
Lists
Only you see this
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.
BibTeX
@article{ateniese2001quasi,
author = {Giuseppe Ateniese and Dawn Xiaodong Song and Gene Tsudik},
title = {{Quasi-Efficient Revocation in Group Signatures}},
journal = {IACR Cryptol. ePrint Arch.},
year = {2001},
url = {https://openreview.net/forum?id=XKlhsVKLAlq},
}| Practical Group Signatures without Random Oracles | IACR ePrint · 2005 |
| Membership Privacy for Fully Dynamic Group Signatures | IACR ePrint · 2018 |
| Efficient Group Signatures without Trapdoors | IACR ePrint · 2002 |
| Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease | arXiv · 2018 |
| An Efficient Revocable Group Signature Scheme in Vehicular Ad Hoc Networks | Ksii · 2015 |
| Efficient user revocation for privacy-aware PKI | Qshine · 2008 |