The DOI matches its Crossref record.
Quasi-Efficient Revocation of Group Signatures
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J., & Lysyanskaya, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_5 · Cited by 732
Bellare, M., Micciancio, D., & Warinschi, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_38 · Cited by 732
Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities
Brickell, E., & Li, J. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2011.63 · Cited by 91
Metadata
- Authors
- Ateniese, G., Song, D., & Tsudik, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 183-197
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1998865180
- Cited by
- 215
- References
- 0
- FWCI
- 10.31
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quasi-Efficient Revocation of Group Signatures. https://app.cochat.ai/papers/10.1007/3-540-36504-4_14
- The paper
- Ateniese, G., Song, D., & Tsudik, G. (2003). Quasi-Efficient Revocation of Group Signatures. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-36504-4_14
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
