Abstract We optimize Zero Knowledge (ZK) proofs of statements expressed as RAM
programs over arithmetic values. Our arithmetic-circuit-based read/write memory uses only 4 …

For a public value $ y $ and a linear function $ f $, giving a zero-knowledge proof of
knowledge of a secret value $ x $ that satisfies $ f (x)= y $ is a key ingredient in many …

Abstract The Fiat-Shamir (FS) transform is a popular technique for obtaining practical zero-
knowledge argument systems. The FS transform uses a hash function to generate, without …

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 …

Recently there has been much academic and industrial interest in practical implementations
of zero knowledge proofs. These techniques allow a party to prove to another party that a …

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 …

Subversion zero knowledge for non-interactive proof systems demands that zero knowledge
(ZK) be maintained even when the common reference string (CRS) is chosen maliciously …

Verification of program safety is often reducible to proving the unsatisfiability (ie, validity) of a
formula in Satisfiability Modulo Theories (SMT): Boolean logic combined with theories that …

Most succinct arguments (SNARKs) are initially only proven knowledge sound (KS). We
show that the commonly employed compilation strategy from polynomial interactive oracle …

The seminal result that every language having an interactive proof also has a zero-
knowledge interactive proof assumes the existence of one-way functions. Ostrovsky and …