← Back to talks
Sep 25 Fri
Friday, 25 September 2026 · 4:00 PM – 5:00 PM · A-201
Fully homomorphic encryption
Speaker: Hari Krishnan P A (STCS)
Host: Malhar A. Managoli
Abstract:

Fully homomorphic encryption allows you to perform additions and multiplications on encrypted data. We will see the easiest construction which lets us do this, which is the approximate eigenvalue method. This construction assumes that the learning-with-error problem is hard and is due to Gentry, Sahai and Waters.