Verifiable Random Functions (VRFs), August 2023
- File formats:
- Also available: XML file for editing
- S. Goldberg
Discuss this RFC: Send questions or comments to the mailing list [email protected]
A Verifiable Random Function (VRF) is the public key version of a keyed cryptographic hash. Only the holder of the secret key can compute the hash, but anyone with the public key can verify the correctness of the hash. VRFs are useful for preventing enumeration of hash-based data structures. This document specifies VRF constructions based on RSA and elliptic curves that are secure in the cryptographic random oracle model.
This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 8729.