A Survey of Two Verifiable Delay Functions

Dan Boneh; Benedikt Bünz; Ben Fisch

Paper 2018/712

A Survey of Two Verifiable Delay Functions

Dan Boneh, Benedikt Bünz, and Ben Fisch

Abstract

A verifiable delay function (VDF) is an important tool used for adding delay in decentralized applications. This short note briefly surveys and compares two recent beautiful Verifiable Delay Functions (VDFs), one due to Pietrzak and the other due to Wesolowski. We also provide a new computational proof of security for one of them, and compare the complexity assumptions needed for both schemes.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Contact author(s): benedikt @ cs stanford edu
History: 2020-01-05: last of 3 revisions; 2018-08-01: received; See all versions
Short URL: https://ia.cr/2018/712
License: CC BY

BibTeX

@misc{cryptoeprint:2018/712,
      author = {Dan Boneh and Benedikt Bünz and Ben Fisch},
      title = {A Survey of Two Verifiable Delay Functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/712},
      year = {2018},
      url = {https://eprint.iacr.org/2018/712}
}