Verifiable Random Functions (VRFs)
MetadataShow full item record
First author draft
Citation (published version)Sharon Goldberg, Jan Vcelak, Dimitrios Papadopoulos, Leonid Reyzin. "Verifiable Random Functions (VRFs)."
A Verifiable Random Function (VRF) is the public-key version of a keyed cryptographic hash. Only the holder of the private key can compute the hash, but anyone with public key can verify the correctness of the hash. VRFs are useful for preventing enumeration of hash-based data structures. This document specifies several VRF constructions that are secure in the cryptographic random oracle model. One VRF uses RSA and the other VRF uses Eliptic Curves (EC).