Fully Homomorphic Encryption

Lecture 1: Fully Homomorphic Encryption I
Lecture 2: Fully Homomorphic Encryption II
 

This series of talks was part of the Cryptography Boot Camp. Videos for each talk area available through the links above.

Speaker: Shai Halevi, IBM T.J. Watson Research Center

Fully-homomorphic encryption allows a worker to receive encrypted data and perform arbitrarily-complex dynamically-chosen computations on that data while it remains encrypted, despite not having the secret decryption key. This tutorial will cover definitions and connections with other concepts in cryptography, with a focus on developments in homomorphic-encryption techniques in the last few years, since Gentry's breakthrough work in 2009.