Speaker: Dragan Rakas

Abstract:
In order to perform computations on encrypted data, it is first required to decrypt the data, and then we can compute. However, homomorphic encryption allows computations to be made on encrypted data without decryption, while maintaining correct outputs. In this talk, we describe one particular cryptosystem that uses homomorphic encryption over the integers, and discuss current issues in the field and implementation bottlenecks. A scalable fully homomorphic cryptosystem would greatly impact applications such as search engines, data storage, banking and many more.