Abstract
A verifiable delay function (VDF) is an important tool used for adding delay in decentralized applications. This paper surveys and compares two beautiful verifiable delay functions, one due to Pietrzak, and the other due to Wesolowski, In addition, we provide a new computational proof of security for one of them, present an attack on an incorrect implementation of the other, and compare the complexity assumptions needed for both schemes.
Publisher
International Association for Cryptologic Research
Reference42 articles.
1. Trustworthy public randomness with sloth, unicorn, and trx;Arjen K Lenstra;International Journal of Applied Cryptography,2017
2. Verifiable Delay Functions;Dan Boneh,2018
3. Public Randomness and Randomness Beacons;Joseph Bonneau,2022
4. Simple Proofs of Sequential Work;Bram Cohen,2018
5. SoK: Delay-Based Cryptography;Liam Medley,2023