## CryptoDB

### Paper: Verifiable Delay Functions

Authors: Dan Boneh Joseph Bonneau Benedikt Bünz Ben Fisch DOI: 10.1007/978-3-319-96884-1_25 (login may be required) Search ePrint Search Google Slides CRYPTO 2018 We study the problem of building a verifiable delay function (VDF). A $\text {VDF}$VDFrequires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. $\text {VDF}$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 $\text {VDF}$VDFs and present new candidate constructions that are the first to achieve an exponential gap between evaluation and verification time.
##### BibTeX
@inproceedings{crypto-2018-28858,
title={Verifiable Delay Functions},
booktitle={Advances in Cryptology – CRYPTO 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={10991},
pages={757-788},
doi={10.1007/978-3-319-96884-1_25},
author={Dan Boneh and Joseph Bonneau and Benedikt Bünz and Ben Fisch},
year=2018
}