Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive
zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits based on symmetric …

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 …

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

MPC-in-the-head based zero-knowledge proofs allow one to prove knowledge of a
preimage for a circuit defined over a finite field F. In recent proofs the soundness depends …

We propose a new class of post-quantum digital signature schemes that:(a) derive their
security entirely from the security of symmetric-key primitives, believed to be quantum …

In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge
arguments especially tailored for Boolean circuits and report on a proof-ofconcept …

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 …

We present a new succinct zero knowledge argument scheme for layered arithmetic circuits
without trusted setup. The prover time is O (C+ nlogn) and the proof size is O (D logC+ log 2 …

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 …

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 …