The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Accumulators from Bilinear Pairings and Applications
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
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
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
Chaum, D., & van Heyst, E. (1991) · Theory and Application of Cryptographic Techniques · Cited by 1,492
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
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
Chaum, D., & van Heyst, E. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_22 · Cited by 1,196
Cited by
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983
Metadata
- Authors
- Nguyen, L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 275-292
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1528195422
- Cited by
- 431
- References
- 35
- FWCI
- 14.31
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Accumulators from Bilinear Pairings and Applications. https://app.cochat.ai/papers/10.1007/978-3-540-30574-3_19
- The paper
- Nguyen, L. (2005). Accumulators from Bilinear Pairings and Applications. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-30574-3_19
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.
