Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …

The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are
based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for …

We introduce and study a simple kind of proof system called line-point zero knowledge
(LPZK). In an LPZK proof, the prover encodes the witness as an affine line $\mathbf …

Recent works on interactive zero-knowledge (ZK) protocols provide a new paradigm with
high efficiency and scalability. However, these protocols suffer from high communication …

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 …

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

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 …

Zero-knowledge proofs and in particular succinct non-interactive zero-knowledge proofs (so
called zk-SNARKs) are getting increasingly used in real-world applications, with …

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 …

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 …