The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Randomizable Proofs and Delegatable Anonymous Credentials
Open accessOverview
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
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Self-citation
Cited by
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598
Formal Treatment of Privacy-Enhancing Credential Systems
Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G. L., Neven, G., & Pedersen, M. Ø. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-31301-6_1 · Cited by 65
Self-citationSTORK: a real, heterogeneous, large-scale eID management system
Ribeiro, C., Leitold, H., Esposito, S., & Mitzam, D. (2018) · International Journal of Information Security · doi:10.1007/s10207-017-0385-x · Cited by 24
Metadata
- Authors
- Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., & Shacham, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 108-125
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2150399720
- Cited by
- 269
- References
- 1
- FWCI
- 19.04
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Randomizable Proofs and Delegatable Anonymous Credentials. https://app.cochat.ai/papers/10.1007/978-3-642-03356-8_7
- The paper
- Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., & Shacham, H. (2009). Randomizable Proofs and Delegatable Anonymous Credentials. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-03356-8_7
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.
