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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Chaum, D., & van Heyst, E. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_22 · Cited by 1,196
Efficient Non-interactive Proof Systems for Bilinear Groups
Groth, J., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_24 · Cited by 1,076
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
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
Brickell, E., Camenisch, J., & Chen, L. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030103 · Cited by 935
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
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
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Boneh, D., & Boyen, X. (2008) · Journal of Cryptology · doi:10.1007/s00145-007-9005-7 · Cited by 605
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Barić, N., & Pfitzmann, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_33 · Cited by 557
Foundations of Group Signatures: The Case of Dynamic Groups
Mihir Bellare, Y., Shi, H., & Zhang, C. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_11 · Cited by 545
Lysyanskaya, A., Rivest, R. L., Sahai, A., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46513-8_14 · Cited by 521
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_28 · Cited by 355
Structure-Preserving Signatures and Commitments to Group Elements
Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., & Ohkubo, M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_12 · Cited by 354
Sequential Aggregate Signatures from Trapdoor Permutations
Lysyanskaya, A., Micali, S., Reyzin, L., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_5 · Cited by 311
Au, M. H., Susilo, W., & Mu, Y. (2006) · Lecture Notes in Computer Science · doi:10.1007/11832072_8 · Cited by 287
Fully Anonymous Group Signatures Without Random Oracles
Groth, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_10 · Cited by 247
Baldimtsi, F., & Lysyanskaya, A. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516687 · Cited by 178
Dynamic Fully Anonymous Short Group Signatures
Delerablée, C., & Pointcheval, D. (2006) · Lecture notes in computer science · doi:10.1007/11958239_13 · Cited by 157
Self-citationGet Shorty via Group Signatures without Encryption
Bichsel, P., Camenisch, J. L., Neven, G., Smart, N. P., & Warinschi, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15317-4_24 · Cited by 121
Algebraic MACs and Keyed-Verification Anonymous Credentials
Chase, M., Meiklejohn, S., & Zaverucha, G. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660328 · Cited by 118
Hanser, C., & Slamanig, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45611-8_26 · Cited by 111
On the Design and Implementation of an Efficient DAA Scheme
Chen, L., Page, D., & Smart, N. P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12510-2_16 · Cited by 85
Protecting privacy by sanitizing personal data: a new approach to anonymous credentials
Canard, S., & Lescuyer, R. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484363 · Cited by 43
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
Abe, M., Groth, J., Ohkubo, M., & Tango, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_14 · Cited by 42
Efficient Attributes for Anonymous Credentials
Camenisch, J. L., & Groß, T. (2012) · ACM Transactions on Information and System Security · doi:10.1145/2133375.2133379 · Cited by 39
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
Efficient and Secure Service-Oriented Authentication Supporting Network Slicing for 5G-Enabled IoT
Ni, J., Lin, X., & Shen, X. S. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2815418 · Cited by 291
Security, Privacy, and Fairness in Fog-Based Vehicular Crowdsensing
Ni, J., Zhang, A., Lin, X., & Shen, X. S. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1600679 · Cited by 271
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
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
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.