Efficient Verifiable Delay Functions

By Benjamin Wesolowski. Journal of Cryptology, 2019

352 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/d89f60535ccc3499ac030163d942de5bc3bcea86

How researchers see this paper

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

In Artificial Intelligence

1. Benedikt Bünz
2. Ben Fisch
3. Joseph Bonneau
4. Shouhuai Xu
5. Alan Szepieniec
6. Dan Boneh
7. Marcus Pendleton
8. Laurent L. Njilla

In Information Systems

1. Benedikt Bünz
2. Ben Fisch
3. Joseph Bonneau
4. Marcus Pendleton
5. Laurent L. Njilla
6. Huashan Chen
7. Dan Boneh
8. Alan Szepieniec

Citations in the corpus

• Verifiable Delay Functions (2018, methodology): “In particular, Lenstra and Wesolowski [48] proposed chaining a series of such puzzles together in a construction called Sloth, with lotteries as a specific motivation.”
• Transparent SNARKs from DARK Compilers (2020, methodology): “To resolve this inefficiency, we utilize a proof of exponentiation (PoE) [44,53] to outsource the computation to the prover.”
• A Survey on Ethereum Systems Security (2019, background): “However, existing VDFs are not post-quantum secure [73, 181] and have limited throughput.”