Aurora: Transparent Succinct Arguments for R1CS
By Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward. IACR Cryptology ePrint Archive, 2019
447 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/e3add65a298819a5dc34d0e3e3480bb1432bce5b
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
- Srinath T. V. Setty
- Dan Boneh
- Henry Corrigan-Gibbs
- Yuval Ishai
- Iddo Bentov
- Elette Boyle
- Eli Ben-Sasson
- Michael Riabzev
In Computational Theory and Mathematics
- Srinath T. V. Setty
- Dan Boneh
- Eli Ben-Sasson
- Michael Riabzev
- Iddo Bentov
- Yinon Horesh
- Henry Corrigan-Gibbs
- Benedikt Bünz
In Information Systems
- Srinath T. V. Setty
- Iddo Bentov
- Dan Boneh
- Henry Corrigan-Gibbs
- Niv Gilboa
- Michael Riabzev
- Markulf Kohlweiss
- Yinon Horesh
Citations in the corpus
- Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, background): “A reasonable criticism for this work is that Ligero [3], zkSTARKs [14], and Aurora [19] are plausibly post-quantum secure (as they rely only on symmetric key primitives), but Spartan as described in this paper is not.”
- Scalable Zero Knowledge with No Trusted Setup (2019, methodology): “However, for sequential computations specified by succinct programs, verification time in our ZK-STARK out-performs that of Aurora.”
- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, methodology): “[21] show how to compile such proofs into SNARGs in the random-oracle model and recent hash-based SNARGs, including Ligero [2], STARK [15], and Aurora [20] are built using this technique.”
- Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017, methodology): “We remark that if we only insisted on space-preserving IOPs (i.e. relax the time requirement) we can essentially rely on the same constructions of [23, 25] by observing that a Reed-Solomon encoding of data of size T can be computed in time polynomial in T with multiple passes on the input using…”
- Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “Recently, Ben-Sasson et al. [12] proposed Aurora , a new ZKP system in the IOP model with the proof size of O (log 2 C ) .”
- Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains (2019, methodology): “Targeting 100-bit security in the VC component and otherwise apples-to-apples comparisons with benchmarks for Aurora [BSCR + 18] and STARKS [BBHR18], we can conservatively use 2048-bit class group elements.”
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, methodology): “Aurora [13] uses similar techniques to STARKs, except that it is designed to run directly over constraint systems like those used in zk-SNARKs.”