Sharon Goldberg and Leo Reyzin release RFC 9381 – Verifiable Random Functions (VRFs)

Congratulations to Sharon Goldberg and Leo Reyzin and their co-authors on the release of RFC 9381 – Verifiable Random Functions (VRFs), a request for comments publication from the Internet Research Task Force (IRTF.)┬áThis project has been almost a decade in the making.

Sharon explained, “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.”

Check out the RFC here.