Time+Place: Wednesday 07/01/2015 14:30 Room 337-8 Taub Bld.
Title: How to Verify Computations without Reexecuting Them
Speaker: Guy Rothblum - CS-Lecture - NOTE UNUSUAL DAY https://guyrothblum.wordpress.com/
Affiliation: Stanford University
Host: Yuval Ishai


Can we prove the correctness of a polynomial-time computation to a 
verifier who cannot re-execute the computation on its own? Such proof 
systems can be used in cloud computing scenarios, allowing weak devices 
(from phones and tablets to wearable or embedded devices) to delegate 
work and storage to a third party, without compromising the correctness 
of delegated computations. I will survey a line of work that answers 
this question, and constructs proof systems for delegating computations 
using the machinery of interactive proofs and cryptography.

Short Bio:

Guy Rothblum is a researcher at Stanford University. He has wide 
interests in theoretical computer science, with a focus on cryptography, 
privacy-preserving data analysis, security and complexity theory. His 
research aims to promote a foundational understanding of computing under 
security, privacy, and reliability concerns.