[BBBF18] Verifiable Delay Functions
Authors: Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch | Venue: CRYPTO 2018 | Source
Abstract
We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. VDFs have many applications in decentralized systems, including public randomness beacons, leader election in consensus protocols, and proofs of replication. We formalize the requirements for VDFs and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.
BibTeX
@Inproceedings{C:BBBF18,
author = {Dan Boneh and Joseph Bonneau and Benedikt B{\"u}nz and Ben Fisch},
title = {Verifiable Delay Functions},
pages = {757--788},
editor = {Hovav Shacham and Alexandra Boldyreva},
booktitle = {Advances in Cryptology -- {CRYPTO}~2018, Part~I},
volume = {10991},
series = {Lecture Notes in Computer Science},
address = {Santa Barbara, CA, USA},
month = {aug~19--23},
publisher = {Springer, Cham, Switzerland},
year = {2018},
doi = {10.1007/978-3-319-96884-1_25},
}