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 …

The recent work of Caulk introduces the security notion of position hiding linkability for vector
commitment schemes, providing a zero-knowledge argument that a committed vector's …

We present Hyperproofs, the first vector commitment (VC) scheme that is efficiently
maintainable and aggregatable. Similar to Merkle proofs, our proofs form a tree that can be …

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 …

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 …

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 BalanceProofs, the first vector commitment that is maintainable (ie, supporting
sublinear updates) while also enjoying fast proof aggregation and verification. The basic …

Vector commitments enable a user to commit to a sequence of values and provably reveal
one or many values at specific posi-tions at a later time. In this work, we construct …

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 …

We put forward the notion of subvector commitments (SVC): An SVC allows one to open a
committed vector at a set of positions, where the opening size is independent of length of the …