URA Seminar - Sam Jaques

Title: Sometimes you can't compute on encrypted data 

Abstract: A long dream in cryptography was "fully homomorphic encryption": the ability to perform computations on encrypted data. This way, a cloud provider can do your computations without compromising your privacy. The first general method was proposed by Gentry in 2009, but this method and follow up works are all too slow for many purposes. Naturally, we want to do better. This talk will explain some work in progress from a pessimistic perspective: when can we prove that faster methods are impossible.