The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Aurora: Transparent Succinct Arguments for R1CS
Overview
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
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
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
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
Zerocash: 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
Self-citationProof 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
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 · cited 2×
“Bulletproofs [31, 35] proves the satisfaction of an N -gate arithmetic circuit via a recursive use of a low-communication protocol for inner products, achieving a proof with O(logN) group elements.”
BackgroundMethodProbabilistic 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
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
Scalable, transparent, and post-quantum secure computational integrity.Preprint
Ben‐Sasson, E., Bentov, I., Horesh, Y., & Riabzev, M. (2018) · IACR Cryptology ePrint Archive · Cited by 873
Self-citationPinocchio: 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
Succinct non-interactive zero-knowledge for a von Neumann architecture
Ben‐Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · Cited by 772
Self-citationQuadratic Span Programs and Succinct NIZKs without PCPs
Gennaro, R., Gentry, C., Parno, B., & Raykova, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_37 · Cited by 724
Algebraic 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
SNARKs 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
Self-citationInteractive 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
Non-deterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (1992) · Computational Complexity · doi:10.1007/bf01200430 · Cited by 520
Non-deterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (1991) · Computational Complexity · doi:10.1007/bf01200056 · Cited by 458
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
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
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Bootle, J., Cerulli, A., Chaidos, P., Groth, J., & Petit, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_12 · Cited by 325
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
Ames, S., Hazay, C., Ishai, Y., & Venkitasubramaniam, M. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134104 · Cited by 305
BLAKE2: Simpler, Smaller, Fast as MD5
Aumasson, J.-P., Neves, S., Wilcox-O’Hearn, Z., & Winnerlein, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38980-1_8 · Cited by 303
Doubly-Efficient zkSNARKs Without Trusted Setup
Wahby, R. S., Tzialla, I., Shelat, A., Thaler, J., & Walfish, M. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00060 · Cited by 276
Succinct Non-interactive Arguments via Linear Interactive Proofs
Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., & Ostrovsky, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36594-2_18 · Cited by 274
Self-citationBen-Sasson, E., Chiesa, A., & Spooner, N. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53644-5_2 · Cited by 252
Self-citationDelegating Computation: Interactive Proofs for Muggles
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2015) · Journal of the ACM · doi:10.1145/2699436 · Cited by 216
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model.Preprint
Bowe, S., Gabizon, A., & Miers, I. (2017) · IACR Cryptology ePrint Archive · Cited by 203
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
Zerocash: Decentralized Anonymous Payments from Bitcoin.Preprint
Ben‐Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · IACR Cryptology ePrint Archive · Cited by 195
Self-citationGeppetto: Versatile Verifiable Computation
Costello, C., Fournet, C., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B., & Zahur, S. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.23 · Cited by 194
Short PCPs with Polylog Query Complexity
Ben‐Sasson, E., & Sudan, M. (2008) · SIAM Journal on Computing · doi:10.1137/050646445 · Cited by 194
Self-citationNearly-linear size holographic proofs
Polishchuk, A., & Spielman, D. A. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195132 · Cited by 191
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs
Groth, J., & Maller, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-63715-0_20 · Cited by 190
Scalable Zero Knowledge via Cycles of Elliptic Curves
Ben-Sasson, E., Chiesa, A., Tromer, E., & Virza, M. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44381-1_16 · Cited by 189
Self-citationTime-Optimal Interactive Proofs for Circuit Evaluation
Thaler, J. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_5 · Cited by 183
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs
Ben‐Sasson, E., Chiesa, A., Green, M., Tromer, E., & Virza, M. (2015) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2015.25 · Cited by 171
Self-citationvSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., & Papamanthou, C. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.43 · Cited by 170
Constant-round interactive proofs for delegating computation
Reingold, O., Rothblum, G. N., & Rothblum, R. D. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897652 · Cited by 166
Verifying computations without reexecuting them
Walfish, M., & Blumberg, A. J. (2015) · Communications of the ACM · doi:10.1145/2641562 · Cited by 164
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
Cramer, R., & Damgård, I. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055745 · 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
Efficient RAM and Control Flow in Verifiable Outsourced Computation
Wahby, R. S., Setty, S., Ren, Z., Blumberg, A. J., & Walfish, M. (2015) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23097 · Cited by 141
A Multi-party Protocol for Constructing the Public Parameters of the Pinocchio zk-SNARK
Bowe, S., Gabizon, A., & Green, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-662-58820-8_5 · Cited by 138
Resolving the conflict between generality and plausibility in verified computation
Setty, S., Braun, B., Vu, V., Blumberg, A. J., Parno, B. J., & Walfish, M. (2013) · European Conference on Computer Systems · doi:10.1145/2465351.2465359 · Cited by 128
Lipmaa, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42033-7_3 · Cited by 97
On the complexity of interactive proofs with bounded communication
Goldreich, O., & Håstad, J. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(98)00116-1 · Cited by 91
Additive Fast Fourier Transforms Over Finite Fields
Gao, S., & Mateer, T. D. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2079016 · Cited by 91
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
Baum, C., Bootle, J., Cerulli, A., del Pino, R., Groth, J., & Lyubashevsky, V. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96881-0_23 · Cited by 82
Wahby, R. S., Howald, M., Garg, S., Shelat, A. A., & Walfish, M. (2016) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2016.51 · Cited by 79
Full Accounting for Verifiable Outsourcing
Wahby, R. S., Ji, Y., Blumberg, A. J., Shelat, A. A., Thaler, J., Walfish, M., & Wies, T. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3133984 · Cited by 75
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
Boneh, D., Ishai, Y., Sahai, A., & Wu, D. J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56617-7_9 · Cited by 73
Kalai, Y. T., & Raz, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70583-3_44 · Cited by 67
Computational Integrity with a Public Random String from Quasi-Linear PCPs
Ben‐Sasson, E., Bentov, I., Chiesa, A., Gabizon, A., Genkin, D., Hamilis, M., Pergament, E., Riabzev, M., Silberstein, M., Tromer, E., et al. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56617-7_19 · Cited by 61
Self-citationRobust Locally Testable Codes and Products of Codes
Ben‐Sasson, E., & Sudan, M. (2004) · Random Structures and Algorithms · doi:10.1002/rsa.20120 · Cited by 60
Self-citationInteractive Oracle Proofs with Constant Rate and Query Complexity
Ben‐Sasson, E., Chiesa, A., Gabizon, A., Riabzev, M., & Spooner, N. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2017.40 · Cited by 47
Self-citationOn Round-Efficient Argument Systems
Wee, H. (2005) · Lecture notes in computer science · doi:10.1007/11523468_12 · Cited by 41
A Zero-Knowledge Version of vSQL.Preprint
Zhang, Y., Genkin, D., Katz, J. I., Papadopoulos, D., & Papamanthou, C. (2017) · IACR Cryptology ePrint Archive · Cited by 24
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
Ben‐Sasson, E., Kaplan, Y., Kopparty, S., Meir, O., & Stichtenoth, H. (2013) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.42 · Cited by 18
Self-citationCombinatorial PCPs with Short Proofs
Meir, O. (2012) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2012.14 · Cited by 12
Cited by
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., & Ward, N. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-45721-1_26 · Cited by 358
Self-citationA Survey on Zero-Knowledge Proof in Blockchain
Sun, X., Yu, F. R., Zhang, P., Sun, Z., Xie, W., & Peng, X. (2021) · IEEE Network · doi:10.1109/mnet.011.2000473 · Cited by 316
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings
Maller, M., Bowe, S., Kohlweiss, M., & Meiklejohn, S. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3339817 · Cited by 290
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup
Setty, S. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56877-1_25 · Cited by 262
Metadata
- Authors
- Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., & Ward, N. P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2019
- Pages
- 103-128
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2898776076
- Cited by
- 330
- References
- 64
- FWCI
- 14.52
- 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.