We study the problem of building a verifiable delay function (VDF). A VDF VDF requires a
specified number of sequential steps to evaluate, yet produces a unique output that can be …

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

Blockchain, as one of the crypto-intensive creatures, has become a very hot topic recently.
Although many surveys have recently been dedicated to the security and privacy issues of …

An accumulator is a function that hashes a set of inputs into a short, constant-size string
while preserving the ability to efficiently prove the inclusion of a specific input element in the …

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 …

Threshold Signatures allow n parties to share the power of issuing digital signatures so that
any coalition of size at least t+ 1 can sign, whereas groups of t or less players cannot. Over …

Verifiable outsourcing systems offload a large computation to a remote server, but require
that the remote server provide a succinct proof, called a SNARK, that proves that the server …

Since the concept of cryptographic accumulators was first proposed in 1993, it has received
continuous attention from researchers. The application of the cryptographic accumulator is …

We consider the problem of proving in zero knowledge that an element of a public set
satisfies a given property without disclosing the element, ie, for some u,“u∈ S and P (u) …

Abstract Registration-Based Encryption (RBE)[Garg et al. TCC'18] is a public-key encryption
mechanism in which users generate their own public and secret keys, and register their …