Computing + Mathematical Sciences Faculty Candidate Seminar
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.
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.
Contact: Lucinda Acosta at 4843 email@example.com