In recent years, many advances have been made in cryptography, as well as in the
performance of communication networks and processors. As a result, many advanced …

Zero-knowledge succinct arguments of knowledge (zkSNARKs) enable efficient privacy-
preserving proofs of membership for general NP languages. Our focus in this work is on post …

Succinctness and zero-knowledge are two fundamental properties in the study of
cryptographic proof systems. Several recent works have formalized the connections …

Zero-knowledge arguments of knowledge are powerful cryptographic primitives that allow a
computationally strong prover to convince a weaker verifier for the validity of an NP …

Traditionally, confidentiality and integrity have been two desirable design goals that are
have been dicult to combine. Zero-Knowledge Proofs of Knowledge (ZKPK) offer a rigorous …

In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …

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 construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …

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 …

Interactive theorem provers (ITPs), such as Lean and Coq, can express formal proofs for a
large category of theorems, from abstract math to software correctness. Consider Alice who …