The basic nature of encryption has always been all-or-nothing: anyone
who knows the secret key can decode and recover the entire data; but,
without the key, nothing can be revealed.
Modern technologies such as cloud computing raise fundamentally new
challenges: Can we compute on encrypted data without decrypting it,
and without knowledge of the secret key? Which functions can be computed
this way? Who can learn the results of such computations?
In this talk, I will present my work on constructing fully homomorphic
encryption and functional encryption schemes, two powerful methods
of computing on encrypted data that answer these challenges.
Vinod Vaikuntanathan is an assistant professor of Computer
Science at the University of Toronto. He received his S.M. and
Ph.D. degrees from MIT, and a B.Tech. degree from the Indian
Institute of Technology, all in Computer Science. His research
interests lie in cryptography, complexity theory and the
theory of distributed algorithms. He is a recipient of the 2008
IBM Josef Raviv Postdoctoral Fellowship, the 2009 George M. Sprowls
award for the best MIT Ph.D. thesis in Computer Science, and
the 2013 Alfred P. Sloan Research Fellowship.