Verifiable Random Functions (VRFs)
draft-goldbe-vrf-01
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2017-07-21 (latest revision 2017-06-30) | ||
| Replaced by | draft-irtf-cfrg-vrf | ||
| Stream | IRTF | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
pdf
html
bibtex
|
||
| Stream | IRTF state | (None) | |
| Consensus Boilerplate | Unknown | ||
| Document shepherd | No shepherd assigned | ||
| IESG | IESG state | Replaced by draft-irtf-cfrg-vrf | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | irsg@irtf.org | ||
https://www.ietf.org/archive/id/draft-goldbe-vrf-01.txt
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
(goldbe@cs.bu.edu)
Dimitrios Papadopoulos
(dipapado@bu.edu)
Jan Včelák
(jvcelak@ns1.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)