Verifiable Random Functions (VRFs)
Files
First author draft
Date
DOI
Authors
Goldberg, Sharon
Vcelak, Jan
Papadopoulos, Dimitrios
Reyzin, Leonid
Version
First author draft
OA Version
Citation
Sharon Goldberg, Jan Vcelak, Dimitrios Papadopoulos, Leonid Reyzin. "Verifiable Random Functions (VRFs)."
Abstract
A Verifiable Random Function (VRF) is the public-key version of a
keyed cryptographic hash. Only the holder of the private key can
compute the hash, but anyone with public key can verify the
correctness of the hash. VRFs are useful for preventing enumeration
of hash-based data structures. This document specifies several VRF
constructions that are secure in the cryptographic random oracle
model. One VRF uses RSA and the other VRF uses Eliptic Curves (EC).
Description
License
Copyright (c) 2018 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to
BCP 78
and the IETF Trust’s Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.