We present batching techniques for cryptographic accumulators and vector commitments in
groups of unknown order. Our techniques are tailored for distributed settings where no …

A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a
short proof that certifies the veracity of a certain NP-statement. In the last decade, a large …

Blockchain technology has emerged as the cornerstone of many decentralized applications
operating among otherwise untrusted peers. However, it is well known that existing …

Set accumulators are cryptographic primitives used to represent arbitrarily large sets of
elements with a single constant-size value and to efficiently verify whether a value belongs …

Blockchain has recently gained massive attention thanks to the success of cryptocurrencies
and decentralized applications. With immutability and tamper-resistance features, it can be …

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 …

Vector commitment schemes allow a user to commit to a vector of values x∈{0, 1} ℓ and
later, open up the commitment to a specific set of positions. Both the size of the commitment …

An aggregatable subvector commitment (aSVC) scheme is a vector commitment (VC)
scheme that can aggregate multiple proofs into a single, small subvector proof. In this paper …

Blockchain systems, as append-only ledgers, are typically associated with linearly growing
participation costs. Therefore, for a blockchain client to interact with the system (query or …

The resurging interest in Byzantine fault tolerant systems will demand more scalable
threshold cryptosystems. Unfortunately, current systems scale poorly, requiring time …