The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
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
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
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
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
Efficient Identity-Based Encryption Without Random Oracles
Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_7 · Cited by 2,014
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
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
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
Chaum, D., & van Heyst, E. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_22 · Cited by 1,196
Self Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · 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
Information Security and Privacy
Hutchison, D., Boyd, C., González Nieto, J., Weikum, G., Mitchell, J. C., Kleinberg, J. M., Takeo Kanade, A., Mattern, F., Naor, M., Nierstrasz, O., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02620-1 · Cited by 1,040
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
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
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
Non-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
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
Ateniese, G., Camenisch, J., Joye, M., & Tsudik, G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_16 · Cited by 800
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6 · Cited by 779
Advances in Cryptology – CRYPTO 2016
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53018-4 · Cited by 767
(2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26951-7 · Cited by 753
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
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
Bellare, M., Micciancio, D., & Warinschi, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_38 · Cited by 732
(1991) · Lecture notes in computer science · doi:10.1007/3-540-46416-6 · Cited by 725
Universally composable two-party and multi-party secure computation
Canetti, R., Lindell, Y., Ostrovsky, R., & Sahai, A. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509980 · Cited by 717
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
(2004) · Lecture notes in computer science · doi:10.1007/b99099 · Cited by 709
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
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
Advances in Cryptology - Eurocrypt 2006
Serge Vaudenay, B. (2008) · Cited by 514
Blum, M., De Santis, A., Micali, S., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427
Katz, J., & Robshaw, M. J. B. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3 · Cited by 395
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
Self-citationAdvances in Cryptology — ASIACRYPT’98
Ohta, K., & Pei, D. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49649-1 · Cited by 327
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
Nielsen, J. B. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_8 · Cited by 324
Advances in Cryptology – ASIACRYPT 2020
Bullens, W., Katsumata, S., & Pintore, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3 · Cited by 318
On the (In)security of the Fiat-Shamir paradigm
Goldwasser, S., & Kalai, Y. T. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238185 · Cited by 311
Relaxing Chosen-Ciphertext Security
Canetti, R., Krawczyk, H., & Nielsen, J. B. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_33 · Cited by 304
Robust Non-interactive Zero Knowledge
De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., & Sahai, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_33 · Cited by 293
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem
Bellare, M., Boldyreva, A., & Palacio, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_11 · Cited by 261
Compact Group Signatures Without Random Oracles
Boyen, X., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_26 · Cited by 251
Non-interactive Zaps and New Techniques for NIZK
Groth, J., Ostrovsky, R., & Sahai, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_6 · Cited by 190
Self-citationGroup Signatures: Better Efficiency and New Theoretical Aspects
Camenisch, J., & Groth, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30598-9_9 · Cited by 181
Self-citationZero-knowledge proofs of knowledge without interaction
De Santis, A., & Persiano, G. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267809 · Cited by 161
A Group Signature Scheme with Improved Efficiency (Extended Abstract)
Camenisch, J. L., & Michels, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_14 · Cited by 106
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
Group Signatures with Efficient Concurrent Join
Kiayias, A., & Yung, M. M. (2005) · Lecture notes in computer science · doi:10.1007/11426639_12 · Cited by 82
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
Lindell, Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_10 · Cited by 79
Efficient Group Signatures without Trapdoors
Ateniese, G., & de Medeiros, B. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40061-5_15 · Cited by 75
An Efficient Group Signature Scheme from Bilinear Maps
Furukawa, J., & Imai, H. (2005) · Lecture notes in computer science · doi:10.1007/11506157_38 · Cited by 71
Cited by
On the Size of Pairing-Based Non-interactive Arguments
Groth, J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_11 · Cited by 1,271
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
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Groth, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_19 · Cited by 440
Self-citationMaji, H. K., Prabhakaran, M., & Rosulek, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_24 · Cited by 437
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends
Ateniese, G., Magri, B., Venturi, D., & Andrade, E. (2017) · 2017 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2017.37 · Cited by 433
Metadata
- Authors
- Groth, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 444-459
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1548963432
- Cited by
- 390
- References
- 52
- FWCI
- 6.96
- 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
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.