CryptoDB
A Survey of Two Verifiable Delay Functions Using Proof of Exponentiation
NOTE: imports for ToSC and TCHES are no longer functioning.
Authors: |
|
---|---|
Download: | |
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. |
BibTeX
@article{cic-2024-34127, title={A Survey of Two Verifiable Delay Functions Using Proof of Exponentiation}, journal={cic}, publisher={International Association for Cryptologic Research}, volume={1, Issue 1}, url={https://cic.iacr.org//p/1/1/7}, doi={10.62056/av7tudhdj}, author={Dan Boneh and Benedikt Bünz and Ben Fisch}, year=2024 }