A zero-knowledge (ZK) proof guarantees that the result of a computation is correct while
keeping part of the computation details private. Some ZK proofs are tiny and can be verified …

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 …

Zero-knowledge middleboxes (ZKMBs) are a recent paradigm in which clients get privacy
and middleboxes enforce policy: clients prove in zero knowledge that the plaintext …

Many applications in finance and healthcare need access to data from multiple
organizations. While these organizations can benefit from computing on their joint datasets …

Machine unlearning aims to remove points from the training dataset of a machine learning
model after training; for example when a user requests their data to be deleted. While many …

Zero-knowledge (ZK) proof systems have emerged as a promising solution for building
security-sensitive applications. However, bugs in ZK applications are extremely difficult to …

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 …

Abstract Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover
convinces a verifier of the truth of a statement without revealing any other information …

We study satisfiability modulo the theory of finite fields and give a decision procedure for this
theory. We implement our procedure for prime fields inside the cvc5 SMT solver. Using this …

A large body of work has demonstrated attacks that rely on the difference between CPUs'
nominal instruction set architectures and their actual (microarchitectural) implementations …