The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Quadratic Span Programs and Succinct NIZKs without PCPs
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
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“GGP and related schemes [2, 17] embed a one-time VC scheme, such as a Yao garbled circuit, inside a fully homomorphic encryption (FHE) scheme [25, 26, 44] to obtain reusability.”
MethodSelf-citationRandom 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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,341
Self-citation(1978) · Cited by 1,875
Proof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
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
Probabilistic checking of proofs: a new characterization of NP
Arora, S., & Safra, S. (1998) · Journal of the ACM · doi:10.1145/273865.273901 · Cited by 1,153
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
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
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Boneh, D., Gentry, C., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_16 · Cited by 1,047
Self-citationThe random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
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
Pairing-Friendly Elliptic Curves of Prime Order
Barreto, P. S. L. M., & Naehrig, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11693383_22 · Cited by 877
Pinocchio: Nearly Practical Verifiable Computation
Parno, B., Howell, J., Gentry, C., & Raykova, M. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.47 · Cited by 864
Self-citationAlgebraic methods for interactive proof systems
Lund, C., Fortnow, L., Karloff, H., & Nisan, N. (1992) · Journal of the ACM · doi:10.1145/146585.146605 · Cited by 711
Shamir, A. (1992) · Journal of the ACM · doi:10.1145/146585.146609 · Cited by 662
Checking computations in polylogarithmic time
Babai, L., Fortnow, L., Levin, L. A., & Szegedy, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103428 · Cited by 616
A note on efficient zero-knowledge proofs and arguments (extended abstract)
Kilian, J. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129782 · Cited by 606
Interactive proofs and the hardness of approximating cliques
Feige, U., Goldwasser, S., Lovász, L., Safra, M., & Szegedy, M. (1996) · Journal of the ACM · doi:10.1145/226643.226652 · Cited by 525
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090263 · Cited by 493
Karchmer, M., & Wigderson, A. (2002) · [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference · doi:10.1109/sct.1993.336536 · Cited by 486
Delegating computation: interactive proofs for muggles
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374396 · Cited by 484
Separating succinct non-interactive arguments from all falsifiable assumptions
Gentry, C., & Wichs, D. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993651 · Cited by 456
Self-citationShort 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
Blum, M., De Santis, A., Micali, S., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Improved Delegation of Computation Using Fully Homomorphic Encryption
Chung, K.-M., Kalai, Y., & Vadhan, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_26 · Cited by 403
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
On Cryptographic Assumptions and Challenges
Naor, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_6 · Cited by 360
Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks
Damgård, I. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_36 · Cited by 357
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
Parno, B., Raykova, M., & Vaikuntanathan, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28914-9_24 · Cited by 355
Self-citationRecursive composition and bootstrapping for SNARKS and proof-carrying data
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488623 · Cited by 304
Dwork, C., & Naor, M. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892117 · Cited by 264
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
Bellare, M., & Palacio, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_17 · Cited by 235
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Lipmaa, H. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28914-9_10 · Cited by 223
Practical verified computation with streaming interactive proofs
Cormode, G., Mitzenmacher, M., & Thaler, J. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090245 · Cited by 200
From Secrecy to Soundness: Efficient Verification via Secure Computation: (Extended Abstract)
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14165-2_14 · Cited by 198
Taking proof-based verified computation a few steps closer to practicality
Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A. J., & Walfish, M. (2012) · USENIX Security Symposium · Cited by 176
On the existence of 3-round zero-knowledge protocols
Hada, S., & Tanaka, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055744 · Cited by 175
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Valiant, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_1 · Cited by 175
Making argument systems for outsourced computation practical (sometimes)
Setty, S., McPherson, R., Blumberg, A. J., & Walfish, M. (2012) · Network and Distributed System Security Symposium · Cited by 175
New Techniques for Noninteractive Zero-Knowledge
Groth, J., Ostrovsky, R., & Sahai, A. (2012) · Journal of the ACM · doi:10.1145/2220357.2220358 · Cited by 159
Efficient Arguments without Short PCPs
Ishai, Y., Kushilevitz, E., & Ostrovsky, R. (2007) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2007.10 · Cited by 153
Baier, C., Größer, M., & Bertrand, N. (2012) · Journal of the ACM · doi:10.1145/2108242.2108243 · Cited by 133
Secure Two-Party Computation with Low Communication
Damgård, I., Faust, S., & Hazay, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_4 · Cited by 131
Malleable Proof Systems and Applications
Chase, M., Kohlweiss, M., Lysyanskaya, A., & Meiklejohn, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_18 · Cited by 126
Perfect NIZK with Adaptive Soundness
Abe, M., & Fehr, S. (2007) · Springer eBooks · doi:10.1007/978-3-540-70936-7_7 · Cited by 109
Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs.Preprint
Goldwasser, S., Lin, H., & Rubinstein, A. (2011) · IACR Cryptology ePrint Archive · Cited by 89
On CCA-Secure Somewhat Homomorphic Encryption
Loftus, J., May, A., Smart, N. P., & Vercauteren, F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28496-0_4 · Cited by 88
On the concrete efficiency of probabilistically-checkable proofs
Ben‐Sasson, E., Chiesa, A., Genkin, D., & Tromer, E. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488681 · Cited by 76
Succinct NP Proofs from an Extractability Assumption
Crescenzo, G. D., & Lipmaa, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69407-6_21 · Cited by 61
Towards a Theory of Extractable Functions
Canetti, R., & Dakdouk, R. R. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_35 · Cited by 40
Symmetric Subgroup Membership Problems
Gjøsteen, K. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30580-4_8 · Cited by 25
On the Concrete-Efficiency Threshold of Probabilistically-Checkable ProofsPreprint
Ben‐Sasson, E., Chiesa, A., Genkin, D., & Tromer, E. (2012) · Electronic colloquium on computational complexity · Cited by 24
Subgroup membership problems and public key cryptosystems
Gjøsteen, K. (2004) · NORA - Norwegian Open Research Archives · Cited by 17
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“Most existing SNARK constructions leverage quadratic arithmetic programs [174, 317, 118] and are now available in open-source libraries, such as libsnark [5], and deployed in cryptocurrencies, such as Zcash [57].”
MethodHawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
“Succinct Non-interactive ARguments of Knowledge [12], [33], [49] provide succinct proofs for general computation tasks, and have been implemented by several systems [12], [49], [56].”
BackgroundZerocash: Decentralized Anonymous Payments from Bitcoin
Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.36 · Cited by 1,925
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
Bulletproofs: Short Proofs for Confidential Transactions and More
Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., & Maxwell, G. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00020 · Cited by 1,154
Metadata
- Authors
- Gennaro, R., Gentry, C., Parno, B., & Raykova, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 626-645
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4180724
- Cited by
- 724
- References
- 60
- FWCI
- 29.92
- Type
- conference paper
- Language
- en
- Open access
- bronze
- Licence
- www.springer.com/tdm (tdm)
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.