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

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

Abstract Structure-preserving signatures are signatures defined over bilinear groups that
rely on generic group operations. In particular, the messages and signatures consist of …

Cryptographic accumulators are a common solution to proving information about a large set
S. They allow one to compute a short digest of S and short certificates of some of its basic …

We propose a distributed key generation protocol for the threshold Paillier cryptosystem.
Often in the multiparty computation based on the threshold Paillier cryptosystem, the …

Auction and voting schemes play a crucial role in the Web3 ecosystem. Yet currently
deployed implementations either lack privacy or require at least two rounds, hindering …

Threshold signatures, notably ECDSA, are fundamental for securing decentralized
applications. Their non-linear structure poses challenges in distributed signing, often tackled …

Self-sovereign Identity Management (SSIM) pro-motes self-control of credentials without
relying on external administration. However, the state-of-the-art SSIM based on …

Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming
from the fact that they can be used to force potentially malicious parties to abide by the rules …

A common approach to bootstrap** a new cryptocurrency is an airdrop, an arrangement in
which existing users give away currency to entice new users to join. But current airdrops …