Verifiable Delay Functions and Their Applications
Lecture / Panel
For NYU Community
Speaker: Joseph Bonneau, Courant Institute of Mathematical Sciences
Title: Verifiable Delay Functions and Their Applications
Abstract: This talk will present a new cryptographic primitive, the verifiable delay function (VDF). VDFs are slow to compute, even using a large amount of parallelism. But the result can be verified quickly. This talk will discuss several candidate constructions, but more importantly discuss several interesting applications: publicly verifiable lotteries and proofs-of-replication