ZK-TLV 0x05: Homomorphic Encryption by Max Leibovich

The wonderful world of Homomorphic Encryption Advancements in cryptography in the last few decades introduced several novel tools that allow Alice (client) to encrypt the data in her possession, pass the ciphertexts to Bob (server) and ask Bob to compute any function of her choosing on these ciphertexts, without disclosing any information about her data. One such tool is Fully Homomorphic Encryption (FHE). To get a small taste on how FHE works and how it's even possible to compute on ciphertexts we will see a toy Homomorphic Encryption scheme over the Integers. Next, we will have a bird's-eye view on several techniques that make FHE schemes faster and mention several state-of-the-art implementations. Max is a multidisciplinary software developer with about 10 years of experience in many different technologies and a curious and enthusiastic academic. Nowadays he is working towards a Ph.D. at Haifa University under the guidance of Dr. Adi Akavia. Join the discussion on the zero knowledge facebook group: https://www.facebook.com/groups/800441673459620/ The slides are available on the group.