Cryptology ePrint Archive: Report 2018/712

A Survey of Two Verifiable Delay Functions

Dan Boneh and 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.

Category / Keywords:

Date: received 30 Jul 2018, last revised 27 Aug 2018

Contact author: benedikt at cs stanford edu

Available format(s): PDF | BibTeX Citation

Version: 20180827:165554 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]