Verifiable random function
Verifiable random function (VRF) was introduced by , , and . It is a that provides publicly verifiable proofs of its outputs’ correctness. Given an input value x, the owner of the secret SK can compute the function value y = FSK(x) and the proof pSK(x). Using the proof and the public key , everyone can check that the value y = FSK(x) was indeed computed correctly, yet this information cannot be used to find the secret key.
The original construction was rather inefficient. Later, an efficient and practical verifiable random function was proposed by Yevgeniy Dodis and Aleksandr Yampolskiy. In their construction,
where e(·,·) is a . To verify whether was computed correctly or not, one can check if and .
The proof of security relies on a new decisional bilinear Diffie-Hellman inversion assumption, which asks given as input to distinguish from random.
VRFs provide deterministic precommitments which can revealed at a later time using proofs which can only be generated by a private key. This is useful for providing a 1:1 mapping of low entropy inputs (e.g. names, email addresses, phone numbers) to some random values which can be committed to in advance, e.g. through a timestamping service such as a transparency log.
Unlike traditional digital signature algorithms, VRF outputs can be published publicly without being subject to a preimage attack, even if the verifier knows the public key (but not the proof). This is useful to prevent enumeration of the names/identifiers in a directory which is using a transparency system.