Faculty Candidate Talk: How to Prove the Correctness of Computations

Tuesday, March 7, 2017 -
4:00pm to 5:00pm
CS 1240

Speaker Name: 

Ron Rothblum

Speaker Institution: 




Cookies Location: 

CS 1240


In recent years much of the focus in cryptography has moved past the traditional problem of securing communication, to that of securing computation. A prominent challenge is a setting in which a weak computational client (such as a smartphone or tablet) needs to outsource a complex computation to a powerful but potentially untrusted server.

In the talk we will discuss this problem and focus on new solutions that enable the client to verify the correctness of the computation, even though it does not trust the server. These techniques ensure that both the client's verification procedure is extremely efficient (i.e., much less than re-executing the computation) and also that the overhead involved in proving the correctness of the computation is minimal.