Welcome to the resource topic for 2018/601
Title:
Verifiable Delay Functions
Authors: Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch
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.
ePrint: https://eprint.iacr.org/2018/601
Talk: https://www.youtube.com/watch?v=_-feyaZZjEw
Slides: https://crypto.iacr.org/2018/slides/28858.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .