Events Calendar

CS Colloquium: Guy Rothblum (Stanford) - How to Verify Computations without Reexecuting Them

Speaker: Guy Rothblum, Stanford University

Talk Title: How to Verify Computations without Reexecuting Them

Series: CS Colloquium

Abstract: 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.

Biography: 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.

Dr. Rothblum completed his Ph.D. at MIT, where his advisor was Shafi Goldwasser, and his M.Sc. at The Weizmann Institute of Science, where his advisor was Moni Naor. Until recently, he was a researcher at Microsoft Research’s Silicon Valley Lab (2011-2014).


Host: Computer Science Department

Webcast: https://bluejeans.com/537213719

Location: Olin Hall of Engineering (OHE) - 132

WebCast Link: https://bluejeans.com/537213719

Audiences: Everyone Is Invited

Contact: Assistant to CS chair