Computing + Mathematical Sciences Faculty Candidate Seminar

Wednesday March 13, 2013 4:00 PM

Fully Homomorphic Encryption

Speaker: Zvika Brakerski, Department of Computer Science, Stanford University
Location: Annenberg 105

Abstract :   The problem of constructing fully homomorphic encryption (FHE) is one of the oldest and most fascinating in cryptography. An FHE scheme allows one to perform arbitrary computations f on encrypted data Enc(x), so as to obtain the encryption Enc( f(x) ), using only public information and without learning anything about the value of x. This enables outsourcing computations on private data to a third party, while maintaining the data's privacy (for example "oblivious web search") - a core task for secure cloud computing.

 
The first candidate FHE scheme was introduced in 2009 (over 30 years after the problem was proposed), in Gentry's breakthrough work. This scheme, however, was not without drawbacks: it was a complicated patchwork of a number of components, each relying on a different hardness assumption, and it included labor-intensive procedures that made it hard to implement.

We introduce a new generation of FHE schemes, which is based on a standard cryptographic assumption. Our new schemes enjoy improved security, greater efficiency and simple presentation, and are the basis for modern implementations. In my talk I will explain the notion of FHE, present a "new generation" scheme, and discuss future directions.

 

Series Computing + Mathematical Sciences Lecture Series

Contact: Lucinda Acosta at 4843 lucinda@caltech.edu