Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

By Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza. 2014

739 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Privacy & Security

Citations in the corpus

Honeycrisp: large-scale differentially private aggregation without a trusted core (2019, methodology): “For the range proofs, we estimate a verification cost of 5 ms, based on [10].”
Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, methodology): “In Figure 7, we give conservative estimates of the time required to generate a zkSNARK proof, based on timings of libsnark’s [18] implementation of the Pinocchio system [97] at the 128-bit security level.”
Geppetto: Versatile Verifiable Computation (2015, methodology): “Some previous veriﬁable computations systems do not include a compiler [22, 52], while those that do [10, 16, 46] have typically compiled small examples with less than 100 lines of C code.”
Pinocchio: Nearly Practical Verifiable Computation (2013, methodology): “For GGP, we built a model of its performance based on recent performance results for FHE; for Thaler, we extrapolated from reported results25; while for the others, we used previously published models.22, 23 For Pinocchio, however, we use real numbers from our implementation.”
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “4 libSNARK Ligero Bulletproofs Hyrax libSTARK Aurora Libra [13] [6] [16] [47] [9] [12]”
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016, background): “An exciting line of research [22, 30, 6, 13, 7, 34, 4, 5, 24] has developed many proposals for succinct non-interactive arguments (SNARGs) yielding pairingbased constructions where the arguments consist of a constant number of group elements.”
Verifying computations without reexecuting them (2015, methodology): “BCTV [9] improves on BCGTV by retrieving program instructions from RAM (instead of hard-coding them in the circuit).”
Scalable Zero Knowledge with No Trusted Setup (2019, methodology): “The ﬁrst implementation of a QSP based system is called Pinocchio [63], with subsequent implementations including libSNARK [19, 68] which is used in the Zerocash and Zcash™ implementations; additional implementations appear in [70, 73, 72, 71, 24, 79, 37, 82].”
Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017, methodology): “Like some of those works (most notably, [19]) we use the 16-bit version of the TinyRAM architecture as our model of computation, and support all of its assembly code even though these two programs use only a subset of it.”
RingCT 2.0: A Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero (2017, background): “cryptocurrency is ZCash [9] (released in 2016), which uses zero-knowledge succinct noninteractive argument of knowledge (zk-SNARKs) [10].”
The Efficient Server Audit Problem, Deduplicated Re-execution, and the Web (2017, background): “A possibility is probabilistic proofs [20, 23, 32, 65, 75, 89], but they cannot handle our workloads, so we would have to estimate, and the estimates would yield outlandish speedups for OROCHI (over 106×).”
Doubly-Efficient zkSNARKs Without Trusted Setup (2018, background): “Finally, our comparison does not consider argument systems like libsnark [16, 66] that require trusted setup and non-standard, non-falsifiable assumptions (§2, paragraph 2); Hyrax’s goal is to avoid these requirements.”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “There is a specific type of these proofs called Zero-Knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARK) that is aimed at reducing the complexity and the size of the proof [246].”