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 succinct arguments of knowledge (zkSNARKs) enable efficient privacy-
preserving proofs of membership for general NP languages. Our focus in this work is on post …

We establish new results on the Fiat-Shamir (FS) security of several protocols that are widely
used in practice, and we provide general tools for establishing similar results for others …

We introduce a class of interactive protocols, which we call sumcheck arguments, that
establishes a novel connection between the sumcheck protocol (Lund et al. JACM 1992) …

Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …

We study the problem of constructing succinct zero knowledge proof systems for floating
point computations. The standard approach to handle floating point computations requires …

Abstract We introduce Checkable Subspace Sampling Arguments, a new information
theoretic interactive proof system in which the prover shows that a vector has been sampled …

We introduce the first practical protocols for fully decentralized sealed-bid auctions using
timed commitments. Timed commitments ensure that the auction is finalized fairly even if all …

Motivated by the extended deployment of authenticated data structures (eg, Merkle Patricia
Tries) for verifying massive amounts of data in blockchain systems, we begin a systematic …

This paper presents a new short zero-knowledge argument for the range proof and
arithmetic circuits without a trusted setup. In particular, it can achieve the shortest proof size …