Computer Science/Discrete Mathematics Seminar I

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.