Zero-knowledge (ZK) protocols enable one party to prove to others that it knows a fact
without revealing any information about the evidence for such knowledge. There exist ZK …

Abstract Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali
in 1988, is a fundamental cryptographic primitive which has attracted considerable attention …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

We propose a new characterization of NP using square span programs (SSPs). We first
characterize NP as affine map constraints on small vectors. We then relate this …

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

Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic
primitives used in many constructions, including CCA2-secure cryptosystems, digital …

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 …

While the intuition underlying a zero knowledge proof system [GMR85] is that no
“knowledge” is leaked by the prover to the verifier, researchers are just beginning to analyze …

Concurrent non-malleable zero-knowledge (NMZK) considers the concurrent execution of
zero-knowledge protocols in a setting where the attacker can simultaneously corrupt …

Abstract zk-SNARK constructions that utilize an updatable universal structured reference
string remove one of the main obstacles in deploying zk-SNARKs [GKMMM, Crypto 2018] …