Tutorial on Homomorphic Encryption

Learn about homomorphic encryption in this comprehensive tutorial presented by Shai Halevi at Crypto 2011 in Santa Barbara, CA. Explore the concept of computing on encrypted data, understand the organization of the tutorial, and delve into the fundamentals of Fully Homomorphic Encryption (FHE). Examine the Gentry 2009 blueprint, encryption from Linear ECCSA, and different input encoding methods. Discover additive homomorphism, code living in a ring, and various instantiations. Investigate bootstrapping techniques, performance aspects of the blueprint, and advanced topics beyond the initial framework. Gain insights into Chimeric Homomorphic Encryption as presented in GH 2011b. Access additional presentation materials through the provided link for a deeper understanding of this complex cryptographic concept.

Intro
Computing on Encrypted Data
Organization of the Tutorial
Homomorphic Encryption (FHE)
The (Gentry 2009) blueprint
Encryption from Linear ECCS
A Different input Encoding
Additive Homomorphism
Code Lives in a Ring
Summary Up To Now
Instantiations
Bootstrapping
Everything Else
Performance of Blueprint
Beyond the Blueprint
Chimeric HE GH 2011b