Verifiable Random Functions (VRFs)
draft-goldbe-vrf-01
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Sharon Goldberg , Dimitrios Papadopoulos , Jan Včelák | ||
| Last updated | 2017-07-21 (Latest revision 2017-06-30) | ||
| Replaced by | draft-irtf-cfrg-vrf | ||
| RFC stream | Internet Research Task Force (IRTF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | IRTF state | (None) | |
| Consensus boilerplate | Unknown | ||
| Document shepherd | (None) | ||
| IESG | IESG state | Replaced by draft-irtf-cfrg-vrf | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | irsg@irtf.org |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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).
Authors
Sharon Goldberg
Dimitrios Papadopoulos
Jan Včelák
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)