Efficient Verifiable Delay Functions

YouTube·Cryptography

Explore a presentation on Efficient Verifiable Delay Functions, delivered at EUROCRYPT 2019 by Benjamin Wesolowski. Delve into the concept of Verifiable Delay Functions, their requirements, and various approaches including ad hoc methods and cryptographic attempts. Examine specific implementations like SLOTH, UNICORN, and iterated hashing, as well as time lock puzzles. Investigate succinct proofs, interactive arguments, and key properties of these functions. Analyze security considerations, including the Adaptive Root Assumption and its application in RSA groups and class groups. Learn about the $1,000,000 competition and the Time Lock Assumption. Gain insights into this cutting-edge cryptographic research and its potential applications.