Verifiable Delay Functions

By Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. IACR Cryptology ePrint Archive, 2018

504 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Transparent SNARKs from DARK Compilers (2020, background): “, proving that x(2) T = y with O(log T ) proof size and verification time in order to build a conceptually simple verifiable delay function [10] based on the RSW time-lock puzzle [46].”
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, background): “3339817 to anonymous credentials [6, 27, 28, 32, 39], with a multitude of other settings that also require a balance between privacy and integrity [17, 19, 29, 31, 36].”
Zether: Towards Privacy in a Smart Contract World (2020, background): “There are several PoS protocols [23, 28, 45] which all roughly follow the following simplified design: Users stake a number of coins and then a random beacon [9,11,68] is used to select one or a subset of them as leaders.”
Efficient Verifiable Delay Functions (2019, methodology): “[4] under the name of verifiable delay functions.”
A Survey on Ethereum Systems Security (2019, background): “To resolve this issue, Verifiable Delay Functions (VDFs) [72] are introduced to assure that no participant can compute the random seed before submitting its own entropy.”