Plonk is a widely used succinct non-interactive proof system that uses univariate polynomial
commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as …

The Internet of Things includes all connected objects from small embedded systems with low
computational power and storage capacities to efficient ones, as well as moving objects like …

Accumulation is a simple yet powerful primitive that enables incrementally verifiable
computation (IVC) without the need for recursive SNARKs. We provide a generic, efficient …

We present position-hiding linkability for vector commitment schemes: one can prove in zero
knowledge that one or m values that comprise commitment\cm all belong to the vector of …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

This paper introduces HyperNova, a recursive argument for proving incremental
computations whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a …

Advanced cryptographic protocols such as Zero-knowledge (ZK) proofs of knowledge,
widely used in cryptocurrency applications such as Zcash, Monero, Filecoin, Tezos, Topos …

We introduce a new class of succinct arguments, that we call elastic. Elastic SNARKs allow
the prover to allocate different resources (such as memory and time) depending on the …

We propose a new hash function Reinforced Concrete, which is the first generic purpose
hash that is fast both for a zero-knowledge prover and in native x86 computations. It is …

We present a protocol called $\mathsf {cq} $ for checking the values of a committed
polynomial $ f (X)\in\mathbb {F} _ {< n}(X) $ over a multiplicative subgroup …