Speaker: Ron Rothblum, MIT
Title: How to Prove the Correctness of Computations
In recent years much of the focus in cryptography has shifted from the classical goals of securing communication to securing computation. Authenticating the correctness of computations has emerged as a central challenge in this new frontier. For example, we want to enable a client with limited computational resources (such as a smartphone or tablet) to outsource an expensive computation to a powerful, but untrusted, server.
In the talk we will discuss new results that allow the client to verify the correctness of the Computation. These techniques, which are generic (rather than being tailored to specific computations), ensure that:
1. The client's verification process is extremely efficient (and in particular, far less expensive than re-executing the computation).
2. The server's overhead in proving the correctness of the computation is minimal (i.e., not much more than the cost of merely performing the computation).
Ron Rothblum completed his PhD at the Weizmann Institute of Science in 2015, advised by Prof. Oded Goldreich. His dissertation, titled "Verifiable Outsourcing of Computation", received the John F. Kennedy Ph.D. Distinction Prize and the Shimon Even Prize in Theoretical Computer Science. He is currently a postdoctoral associate at MIT. His research is focused on cryptography and theoretical computer science in general.
Talk sponsored by: Depts. of Computer Science/Mathematics
For additional information contact Steve Easterbrook