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.

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

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},
note = {\url{https://eprint.iacr.org/2018/712}},
url = {https://eprint.iacr.org/2018/712}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.