This paper follows the line of works that design concretely efficient transparent sublinear
zero-knowledge Interactive Oracle Proofs (IOP). Arguments obtained via this paradigm have …

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 …

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 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 …

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 …

Zero knowledge proofs are an important building block in many cryptographic applications.
Unfortunately, when the proof statements become very large, existing zero-knowledge proof …

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

Noninteractive zero-knowledge (NIZK) proof systems are fundamental primitives used in
many cryptographic constructions, including public-key encryption secure against chosen …

Zero-knowledge (ZK) proofs with an optimal memory footprint have attracted a lot of
attention, because such protocols can easily prove very large computation with a small …

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 …