Web3 applications based on blockchains regularly need access to randomness that is
unbiased, unpredictable, and publicly verifiable. For Web3 gaming applications, this …

A trustworthy source of randomness is a crucial component of many decentralized and
crypto-based application systems, especially blockchain consensus. A decentralized …

Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan (FOCS'99), are
the public-key equivalent of pseudorandom functions. A public verification key and proofs …

A verifiable random function (VRF) allows one to compute a random-looking image, while at
the same time providing a unique proof that the function was evaluated correctly. VRFs are a …

In order to solve the problem of low efficiency and high energy consumption of the Proof-of-
Work (PoW) consensus protocol in blockchain within a peer-to-peer network, some new …

We construct more efficient cryptosystems with provable security against adaptive attacks,
based on simple and natural hardness assumptions in the standard model. Concretely, we …

Abstract Verifiable Random Functions (VRFs) play a pivotal role in Proof of Stake (PoS)
blockchain due to their applications in secret leader election protocols. However, the original …

Verifiable random function is a powerful function that provides a noninteractively public
verifiable proof for its output. Recently, verifiable random function has found essential …

Verifiable random functions (VRFs) are a useful extension of pseudorandom functions for
which it is possible to generate a proof that a certain image is indeed the correct function …

Recently, many sharding blockchain protocols have sacrificed some important attributes to
improve scalability, and this makes them complicated and insecure. Moreover, achieving a …