Succinct arguments are proof systems that allow a powerful, but untrusted, prover to
convince a weak verifier that an input x belongs to a language L∈ NP, with communication …

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 …

Recent works on interactive zero-knowledge (ZK) protocols provide a new paradigm with
high efficiency and scalability. However, these protocols suffer from high communication …

This paper presents Reef, a system for generating publicly verifiable succinct non-interactive
zero-knowledge proofs that a committed document matches or does not match a regular …

Learning parity with noise (LPN) has been widely studied and used in cryptography. It was
recently brought to new prosperity since Boyle et al.(CCS'18), putting LPN to a central role in …

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 …

Post hoc auditing of model fairness suffers from potential drawbacks:(1) auditing may be
highly sensitive to the test samples chosen;(2) the model and/or its training data may need to …

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 …

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 …

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 …