Verifiable Random Functions

This seminal paper introduces the concept of a Verifiable Random Function (VRF), a cryptographic primitive that provides a publicly verifiable proof of correctness for a pseudorandom output. Unlike standard pseudo-random functions (PRFs), a VRF allows a user to generate a random value along with a non-interactive proof. Any third party, possessing the prover's public key, can verify that the generated value is indeed the correct result of the function applied to a given input, without needing to know the secret key or the internal state of the generator. The authors establish the formal definitions, security properties—namely uniqueness, collision resistance, and pseudorandomness—and propose concrete constructions. The VRF has become a foundational building block in blockchain systems, providing a mechanism for leader election, random number generation in smart contracts, and efficient proof-of-stake selection processes. By enabling verifiable unpredictability, VRFs resolve critical challenges in distributed systems that require trustless random sources that cannot be manipulated by participants, ensuring fairness and security in decentralized protocols.