Homomorphic Encryption - Shai Halevi

Homomorphic EncryptionShai Halevi (IBM Research)April 2017 AbstractFully Homomorphic Encryption (FHE) has been called the Swiss Army knife of cryptog-raphy , since it provides a single tool that can be uniformly applied to many cryptographicapplications. In this tutorial we study FHE and describe its different properties, relations withother concepts in cryptography, and constructions. We briefly discuss the three generations ofFHE constructions since Gentry s breakthrough result in 2009, and cover in detail the third-generation scheme of Gentry, Sahai, and Waters (GSW). tutorial was written in honor of Oded Goldreichs 60th birthday, and waspublished (with minor changes) as part of the book Tutorials on the Foundations of Cryptography ,edited by Yehuda Lindell [67].

1.1 Applications of Homomorphic Encryption Fully homomorphic encryption has been called the \Swiss Army knife of cryptography" [6], since it provides a single tool that can be uniformly applied in a wide host of applications. Even when we have other solutions to a cryptographic problem, the FHE-based ones are often conceptually

Loading..

Tags:

  Applications, Encryption, Applications of homomorphic encryption, Homomorphic, Homomorphic encryption

Information

Related search queries