E Ben-Sasson, A Chiesa, E Tromer… - 23rd USENIX Security …, 2014 - usenix.org
We build a system that provides succinct non-interactive zero-knowledge proofs (zk- SNARKs) for program executions on a von Neumann RISC architecture. The system has two …
We propose SublonK---a new succinct non-interactive argument of knowledge (SNARK). SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …
A decade of active research has led to practical constructions of zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) that are now being used in a wide …
We propose a new characterization of NP using square span programs (SSPs). We first characterize NP as affine map constraints on small vectors. We then relate this …
S Setty - Annual International Cryptology Conference, 2020 - Springer
This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …
We study the problem of building non-interactive proof systems modularly by linking small specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …
The last few years have witnessed increasing interest in the deployment of zero-knowledge proof systems, in particular ones with succinct proofs and efficient verification (zk-SNARKs) …
We present Libra, the first zero-knowledge proof system that has both optimal prover time and succinct proof size/verification time. In particular, if C is the size of the circuit being …
There have been tremendous advances in reducing interaction, communication and verification time in zero-knowledge proofs but it remains an important challenge to make the …