Computer Science/Discrete Mathematics Seminar I

Efficient Verification of Computation on Untrusted Platforms

Efficient verification of computation is fundamental to computer science and is at the heart of the P vs. NP question. Recently it has had growing practical significance, especially with the increasing popularity of blockchain technologies and cloud computing. In this talk, I will present schemes for verifying the correctness of a computation.  I will discuss their impact, both on cryptography and on theory of computation at large, as well as their impact on practice. 

Date & Time

February 13, 2023 | 11:15am – 12:15pm


Simonyi 101 and Remote Access


Yael Kalai


Massachusetts Institute of Technology/Microsoft