Verifiable Random Functions
RFC 9381, “Verifiable Random Functions”, is an Informational document published in August 2023 by S. Goldberg, L. Reyzin, D. Papadopoulos, J. Včelák. The canonical text is published by the RFC Editor.
Abstract
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.
What “Informational” means
Published for the general information of the community. It does not define an IETF standard and carries no standards-track status.
The canonical text of RFC 9381 is hosted at rfc-editor.org. Available in HTML,TXT,PDF,XML.
- RFC 9380 Hashing to Elliptic Curves
- RFC 9382 SPAKE2, a Password-Authenticated Key Exchange
- RFC 9383 SPAKE2+, an Augmented Password-Authenticated Key Exchange Protocol
- RFC 9378 In Situ Operations, Administration, and Maintenance Deployment
- RFC 9384 A BGP Cease NOTIFICATION Subcode for Bidirectional Forwarding Detection
- RFC 9377 IS-IS Flood Reflection
- RFC 9385 Using GOST Cryptographic Algorithms in the Internet Key Exchange Protocol Version 2
- RFC 9376 Applicability of GMPLS for beyond 100 Gbit/s Optical Transport Network