Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

By Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit. 2016

413 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

How researchers see this paper

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

In Artificial Intelligence

1. Srinath T. V. Setty
2. Dan Boneh
3. Eli Ben-Sasson
4. Michael Walfish
5. Michael Riabzev
6. Iddo Bentov
7. Madars Virza
8. Eran Tromer

In Computational Theory and Mathematics

1. Eli Ben-Sasson
2. Srinath T. V. Setty
3. Michael Walfish
4. Michael Riabzev
5. Iddo Bentov
6. Dan Boneh
7. Yinon Horesh
8. Madars Virza

In Information Systems

1. Srinath T. V. Setty
2. Dan Boneh
3. Iddo Bentov
4. Michael Riabzev
5. Eli Ben-Sasson
6. Yinon Horesh
7. Markulf Kohlweiss
8. Benedikt Bünz

Citations in the corpus

• Bulletproofs: Short Proofs for Confidential Transactions and More (2018, methodology): “We reduce the communication complexity of the argument from 6 log2pnq in [7] to only 2 log2pnq, where n is the dimension of the two vectors.”
• Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, background): “[22] to embed the left hand side of Equation 1 into the constant term of a polynomial”
• Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “Before Bulletproof [20], earlier discrete-log based ZKP schemes include the work of Groth [33], Bayer and Groth [8] and Bootle et al. [17].”
• Distributed Differentially Private Averaging with Improved Utility and Robustness to Malicious Parties (2020, background): “[15] Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, and Christophe Petit.”
• Transparent SNARKs from DARK Compilers (2020, background): “[14] with the inner-product argument of Bünz et al.”
• Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, background): “[30] building on its predecessors [11, 55] provide a zero-knowledge argument for the satisfiability of arithmetic circuits under the hardness of computing discrete logarithms.”
• Doubly-Efficient zkSNARKs Without Trusted Setup (2018, methodology): “(In contrast, many recent works invoke cryptographic primitives for each gate in the verifying circuit [12, 13, 16, 24, 30, 46, 79]; §2.”
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (2017, background): “to poly log T in [30], which also implemented both versions; verifier running time in both variants is Ω(T ).”
• Scalable, transparent, and post-quantum secure computational integrity (2018, methodology): “[31] Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, and Christophe Petit.”