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 …

Abstract Zero-Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARKs)
are non-interactive systems with short proofs (ie, independent of the size of the witness) that …

Non-interactive zero-knowledge proofs of knowledge for general NP statements are a
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …

We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …

Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …

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 …

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 …

Abstract Zero-Knowledge Proofs (ZKPs), especially Succinct Non-interactive ARguments of
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …

Succinct zero knowledge proofs (ie zkSNARKs) are powerful cryptographic tools that enable
a prover to convince a verifier that a given statement is true without revealing any additional …

As a recent cryptography protocol, Zero-Knowledge Succinct Non-Interactive Argument of
Knowledge (zk-SNARK) allows one party to prove that it possesses certain information …