You are looking at a specific version 20180822:033812 of this paper.
See the latest version.
Paper 2018/601
Verifiable Delay Functions
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.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in CRYPTO 2018
- Keywords
- VDFproof of sequential worktime-lock puzzleRSA
- Contact author(s)
- benafisch @ gmail com
- History
- 2019-06-26: last of 6 revisions
- 2018-06-18: received
- See all versions
- Short URL
- https://ia.cr/2018/601
- License
-
CC BY