Uploaded October 2024 | Updated September 2026, 2 weeks ago
Compressing Proofs Using Cryptography
Yael Tauman Kalai
ACM Prize in Computing 2022
Imagine if you could take a proof and make it significantly shorter.
In this talk, we will see how this can be done using cryptographic magic!
We will begin with a brief overview of the evolution of proofs in computer science.
We will then show how this beautiful theory, when combined with cryptographic methods, can be used to compress proofs.
The 11th Heidelberg Laureate Forum took place from September 22–27, 2024. #HLF24
The Heidelberg Laureate Forum (HLF) is an annual networking conference where 200 carefully selected young researchers in mathematics and computer science spend a week interacting with the laureates of the most prestigious awards in their disciplines: the Abel Prize, ACM A.M. Turing Award, ACM Prize in Computing, Fields Medal, IMU Abacus Medal and Nevanlinna Prize.
The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of these videos.
More information on the Heidelberg Laureate Forum: heidelberg-laureate-forum.org
Follow us on social media!
Blog: scilogs.spektrum.de/hlf
LinkedIn: linkedin.com/company/heidelberg-laureate-forum-foundation
X/Twitter: twitter.com/HLForum
Instagram: instagram.com/hlforum
Facebook: facebook.com/HeidelbergLaureateForum
Compressing Proofs Using Cryptography
Yael Tauman Kalai
ACM Prize in Computing 2022
Imagine if you could take a proof and make it significantly shorter.
In this talk, we will see how this can be done using cryptographic magic!
We will begin with a brief overview of the evolution of proofs in computer science.
We will then show how this beautiful theory, when combined with cryptographic methods, can be used to compress proofs.
The 11th Heidelberg Laureate Forum took place from September 22–27, 2024. #HLF24
The Heidelberg Laureate Forum (HLF) is an annual networking conference where 200 carefully selected young researchers in mathematics and computer science spend a week interacting with the laureates of the most prestigious awards in their disciplines: the Abel Prize, ACM A.M. Turing Award, ACM Prize in Computing, Fields Medal, IMU Abacus Medal and Nevanlinna Prize.
The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of these videos.
More information on the Heidelberg Laureate Forum: heidelberg-laureate-forum.org
Follow us on social media!
Blog: scilogs.spektrum.de/hlf
LinkedIn: linkedin.com/company/heidelberg-laureate-forum-foundation
X/Twitter: twitter.com/HLForum
Instagram: instagram.com/hlforum
Facebook: facebook.com/HeidelbergLaureateForum
