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

We show a constant-overhead interactive zero-knowledge (ZK) proof system for RAM
programs, that is, a ZK proof in which the communication complexity as well as the running …

Cryptographic tools like proof systems, multi-party computation, and fully homomorphic
encryption are usually applied to computations expressed as systems of arithmetic …

We explore Zero-Knowledge Proofs (ZKPs) of statements expressed as programs written in
high-level languages, eg, C or assembly. At the core of executing such programs in ZK is the …

Existing protocols for proving the correct execution of a RAM program in zero-knowledge are
plagued by a processor expressiveness tradeoff: supporting fewer instructions results in …

Currently, when a security analyst discovers a vulnerability in critical software system, they
must navigate a fraught dilemma: immediately disclosing the vulnerability to the public could …

In MPC, we usually represent programs as circuits. This is a poor fit for programs that use
complex control flow, as it is costly to compile control flow to circuits. This motivated prior …

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 …

Privacy concerns prevent the adoption of smart contracts in sensitive domains incompatible
with the public nature of shared ledgers. We present Zapper, a privacy-focused smart …

Vector Oblivious Linear Evaluation (VOLE) supports fast and scalable interactive Zero-
Knowledge (ZK) proofs. Despite recent improvements to VOLE-based ZK, compiling proof …