Transcription of Homomorphic Encryption - Shai Halevi
{{id}} {{{paragraph}}}
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).
Homomorphic encryption provides an elegant solution to this conundrum. The company can keep the information in the cloud in encrypted form, and the cloud provider can process the information in this form and send only the processed result back to the company to be decrypted.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}