20th Estonian Winter School in Computer Science (EWSCS)
XX Eesti Arvutiteaduse Talvekool

Palmse, Estonia, March 1 - 6, 2015

Zvika Brakerski

Dept. of Computer Science and Applied Mathematics
Weizmann Institute
Rehovot
Israel

Fully homomorphic encryption

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 problem has been presented back in 1978, but the first candidate was only introduced in 2009 in Gentry's breakthrough work. Since then, there have been rapid and exciting developments. In this course I will define fully homomorphic encryption, survey the literature, and present state of the art constructions.

Course materials

Valid CSS! Valid XHTML 1.0 Strict Last changed April 17, 2016 21:56 Europe/Helsinki (GMT +03:00) by local organizers, ewscs15(at)cs.ioc.ee
EWSCS'15 page: http://cs.ioc.ee/ewscs/2015/