The DOI matches its Crossref record; 32 of the 32 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.
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
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
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
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
Self-citationShort 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
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
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-citationHierarchical ID-Based Cryptography
Gentry, C., & Silverberg, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_34 · Cited by 1,088
Efficient group signature schemes for large groups: Extended abstract
Camenisch, J., & Stadler, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052252 · Cited by 1,083
Self-citationEfficient 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
Foundations of Cryptography: Basic Tools
Goldreich, O. (2000) · Cambridge University Press eBooks · Cited by 1,019
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
Self-citationNon-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
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
Self-citationRethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Brands, S. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/5931.001.0001 · Cited by 685
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
Self-citationPractical Verifiable Encryption and Decryption of Discrete Logarithms
Camenisch, J., & Shoup, V. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_8 · Cited by 541
Self-citationLysyanskaya, 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
Self-citationBlum, M., De Santis, A., Micali, S., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Lindell, Y., & Pinkas, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72540-4_4 · Cited by 427
Perfect Non-interactive Zero Knowledge for NP
Groth, J., Ostrovsky, R., & Sahai, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_21 · Cited by 381
Chase, M., & Lysyanskaya, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_5 · Cited by 253
Self-citationHow to win the clonewars: efficient periodic n-times anonymous authentication
Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., & Meyerovich, M. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180431 · Cited by 240
Self-citationFull-Domain Subgroup Hiding and Constant-Size Group Signatures
Boyen, X., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71677-8_1 · Cited by 233
P-signatures and Noninteractive Anonymous Credentials
Belenkiy, M., Chase, M., Kohlweiss, M., & Lysyanskaya, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_20 · Cited by 208
Self-citationPayment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
Damgård, I. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_26 · Cited by 146
An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
Kilian, J., & Petrank, E. (1998) · Journal of Cryptology · doi:10.1007/s001459900032 · Cited by 90
Fuchsbauer, G., & Pointcheval, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85855-3_14 · Cited by 58
Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
Fuchsbauer, G., & Pointcheval, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03298-1_10 · Cited by 49
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
Bangerter, E., Camenisch, J. L., & Maurer, U. M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30580-4_11 · Cited by 39
Self-citationDivertible and Subliminal-Free Zero-Knowledge Proofs for Languages
Burmester, M. V. D., Desmedt, Y., Itoh, T., et al. (1999) · Journal of Cryptology · doi:10.1007/s001459900053 · Cited by 11
Cited by
Improving privacy and security in multi-authority attribute-based encryption
Chase, M., & Chow, S. S. M. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653678 · Cited by 795
Self-citationSNARKs 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
(2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8 · Cited by 421
Practical Private Set Intersection Protocols with Linear Complexity
De Cristofaro, E., & Tsudik, G. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14577-3_13 · Cited by 416
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
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
- 32
- 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
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.