The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Constant-Size Dynamic k-TAA
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
Cites
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_9 · Cited by 2,448
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
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Signature Schemes and Anonymous Credentials from Bilinear Maps
Camenisch, J., & Lysyanskaya, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_4 · Cited by 982
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
Micali, S., Rabin, M., & Vadhan, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814584 · Cited by 716
A Signature Scheme with Efficient Protocols
Camenisch, J., & Lysyanskaya, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36413-7_20 · Cited by 662
Efficient Proofs that a Committed Number Lies in an Interval
Boudot, F. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_31 · Cited by 489
Accumulators from Bilinear Pairings and Applications
Nguyen, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30574-3_19 · Cited by 431
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · Cited by 428
Compact Group Signatures Without Random Oracles
Boyen, X., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_26 · Cited by 251
Efficient Blind and Partially Blind Signatures Without Random Oracles
Okamoto, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_5 · Cited by 199
Group signature schemes and payment systems based on the discrete logarithm problem
Camenisch, J. L. (1998) · CERN Document Server (European Organization for Nuclear Research) · doi:10.3929/ethz-a-001923735 · Cited by 170
An Efficient Group Signature Scheme from Bilinear Maps
Furukawa, J., & Imai, H. (2005) · Lecture notes in computer science · doi:10.1007/11506157_38 · Cited by 71
Cited by
Pointcheval, D., & Sanders, O. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29485-8_7 · Cited by 310
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Camenisch, J., Kohlweiss, M., & Soriente, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00468-1_27 · Cited by 288
AlMarshoud, M., Sabir Kiraz, M., & H. Al-Bayatti, A. (2024) · ACM Computing Surveys · doi:10.1145/3656166 · Cited by 145
On Cryptographic Mechanisms for the Selective Disclosure of Verifiable Credentials
Flamini, A., Sciarretta, G., Scuro, M., Sharif, A., Tomasi, A., & Ranise, S. (2024) · arXiv · Cited by 24
“BBS signatures are group signatures presented in [BBS04] and later of readapted in [ASM06,CDL16] to obtain a selective disclosure signature signature BBS+ that we describe in Section 5.3.”
MethodInfluential
Metadata
- Authors
- Au, M. H., Susilo, W., & Mu, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 111-125
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1521092767
- Cited by
- 287
- References
- 16
- FWCI
- 3.36
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.