Universal composability is the de facto standard framework for theoretical cryptography in the literature. Using an intricate tapestry of interactive probabilistic Turing machines, the theory defines security of a multi-party system (such as a voting protocol or a blockchain) in terms of its similarity to an "ideal" system. The ultimate goal is to prove security of protocols in a universal context, no matter how they may be composed.
In this seminar series, Eleanor will take you through the necessary background ideas in theoretical cryptography, and introduce the key definitions and concepts used in universal composability from the ground up.
ScheduleNote this schedule is not yet complete.
What is cryptography? (notes) (video recording)
2022/01/13 11:00:00 +0000
Simulation-based security (notes)
2022/01/20 11:00:00 +0000
Building universal composability (notes) (video recording)
2022/02/03 11:00:00 +0000
The model of interactive computation (Part 1) (notes) (video
2022/02/17 11:00:00 +0000
The model of interactive computation (Part 2)
2022/03/03 11:00:00 +0000
VenueThe seminar series will be conducted at Metauni. To make sure you're set up, follow these instructions: Instructions | metauni.
The venue itself can be found here: Deprecation. Click this link to join on the day.