The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Short Randomizable Signatures
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
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
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Chaum, D., & van Heyst, E. (1991) · Theory and Application of Cryptographic Techniques · Cited by 1,492
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
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
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Cited by
A Survey on IoT Security: Application Areas, Security Threats, and Solution Architectures
Hassija, V., Chamola, V., Saxena, V., Jain, D., Goyal, P., & Sikdar, B. (2019) · IEEE Access · doi:10.1109/access.2019.2924045 · Cited by 1,396
Securing Fog Computing for Internet of Things Applications: Challenges and Solutions
Ni, J., Zhang, K., Lin, X., & Shen, X. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2762345 · Cited by 659
Short Threshold Dynamic Group Signatures
Camenisch, J., Drijvers, M., Lehmann, A., Neven, G., & Towa, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-57990-6_20 · Cited by 59
The OLYMPUS Architecture—Oblivious Identity Management for Private User-Friendly Services
Torres Moreno, R., Bernal Bernabe, J., García Rodríguez, J., Kasper Frederiksen, T., Stausholm, M., Martínez, N., Sakkopoulos, E., Ponte, N., & Skarmeta, A. (2020) · Sensors · doi:10.3390/s20030945 · Cited by 15
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
Metadata
- Authors
- Pointcheval, D., & Sanders, O.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- Pages
- 111-126
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2400148870
- Cited by
- 310
- References
- 36
- FWCI
- 10.89
- 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: Short Randomizable Signatures. https://app.cochat.ai/papers/10.1007/978-3-319-29485-8_7
- The paper
- Pointcheval, D., & Sanders, O. (2016). Short Randomizable Signatures. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-29485-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.