@misc{rfc9381,
    series =    {Request for Comments},
    number =    9381,
    howpublished =  {RFC 9381},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC9381},
    url =       {https://www.rfc-editor.org/info/rfc9381},
    author =    {Sharon Goldberg and Leonid Reyzin and Dimitrios Papadopoulos and Jan Včelák},
    title =     {{Verifiable Random Functions (VRFs)}},
    pagetotal = 47,
    year =      2023,
    month =     aug,
    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.},
}