Abstract
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.
The first session of this talk will take place on Monday, May 18 from 2:00 pm – 3:00 pm.