Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …

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 …

Today, digital identity management for individuals is either inconvenient and error-prone or
creates undesirable lock-in effects and violates privacy and security expectations. These …

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 …

We propose SublonK---a new succinct non-interactive argument of knowledge (SNARK).
SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …

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 …

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 …

We build a complete and efficient ZK toolchain that handles proof statements encoded as
arbitrary ANSI C programs. Zero-Knowledge (ZK) proofs are foundational in cryptography …