CSE Colloquium: Rosario Gennaro

Title: Verifiable Outsourced Computation: A Survey

Location: HBL Class of 1947 Conference room (located behind Bookworms in the Library)

Abstract:

In this talk I will review recent (and not so recent) research on the topic of Verifiable Outsourced Computation. The problem of verifying the correctness of computations done by untrusted parties was a driving motivation behind some of the most celebrated results in Complexity Theory in the 90’s, from Interactive Proofs to the PCP Theorem. More recently this problem has received renewed attention from more applied corners of Computer Science, due to the rise of the Cloud Computing paradigm, where data and computation is outsourced to external “providers” who may not be necessarily trusted. Current research is focused on making some of those “old” theoretical results applicable in practice, a task that ultimately will require both theoretical and more applied systems breakthroughs. 

Bio:

Rosario Gennaro received his Ph.D. in 1996 from the Massachusetts Institute of Technology under the supervision of Prof. Silvio Micali. He then joined the Network Security Department at the IBM T.J.Watson Research Center. In 2012, he moved to the City University of New York, where he directs the Center for Algorithms, a research center focused on “practice driven” Theoretical Computer Science, with a focus on cryptography and network security and quantum computing.