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 …

We present a protocol for checking the values of a committed polynomial $\phi (X) $ over a
multiplicative subgroup $ H\subset\mathbb {F} $ of size $ m $ are contained in a table …

We present a protocol for checking the values of a committed polynomial $ f\in\mathbb {F} _
{< n}[X] $ over a multiplicative subgroup $ H\subset\mathbb {F} $ of size $ n $, are contained …

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 …

This paper introduces Lasso, a new family of lookup arguments, which allow an untrusted
prover to commit to a vector a∈ F m and prove that all entries of a reside in some …

Lookup arguments allow to prove that the elements of a committed vector come from a
(bigger) committed table. They enable novel approaches to reduce the prover complexity of …

We present Baloo, the first protocol for lookup tables where the prover work is linear on the
amount of lookups and independent of the size of the table. Baloo is built over the lookup …

Logarithmic derivatives translate products of linear factors into sums of their reciprocals,
turning zeroes into simple poles of same multiplicity. Based on this simple fact, we construct …

Proofs for machine computation allow for proving the correct execution of arbitrary programs
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …

Abstract Succinct Non-interactive Arguments of Knowledge (SNARKs) allow an untrusted
prover to establish that it correctly ran some “witness-checking procedure” on a witness. A …