Efficient Verifiable Delay Functions
Offered By: TheIACR via YouTube
Course Description
Overview
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.
Syllabus
Intro
VERIFIABLE DELAY FUNCTIONS
REQUIREMENTS
AD HOC "METHODS"
A CRYPTOGRAPHIC ATTEMPT
SLOTH AND UNICORN
ITERATED HASHING
TIME LOCK PUZZLE
SUCCINCT PROOFS
INTERACTIVE ARGUMENT
PROPERTIES
SECURITY
ADAPTIVE ROOT ASSUMPTION
RSA GROUPS
CLASS GROUPS
$1,000,000 COMPETITION
TIME LOCK ASSUMPTION
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera