Scinovex
review Open AccessTop 1% cited

A Survey on Homomorphic Encryption Schemes

ACM Computing Surveys · 2018 · Vol. 51(4) · pp. 1–35
Abbas AcarHidayet AksuA. Selcuk UluagacMauro Conti

Abstract

Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns. The users or service providers with the key have exclusive rights on the data. Especially with popular cloud services, control over the privacy of the sensitive data is lost. Even when the keys are not shared, the encrypted material is shared with a third party that does not necessarily need to access the content. Moreover, untrusted servers, providers, and cloud operators can keep identifying elements of users long after users end the relationship with the services. Indeed, Homomorphic Encryption (HE), a special kind of encryption scheme, can address these concerns as it allows any third party to operate on the encrypted data without decrypting it in advance. Although this extremely useful feature of the HE scheme has been known for over 30 years, the first plausible and achievable Fully Homomorphic Encryption (FHE) scheme, which allows any computable function to perform on the encrypted data, was introduced by Craig Gentry in 2009. Even though this was a major achievement, different implementations so far demonstrated that FHE still needs to be improved significantly to be practical on every platform. Therefore, this survey focuses on HE and FHE schemes. First, we present the basics of HE and the details of the well-known Partially Homomorphic Encryption (PHE) and Somewhat Homomorphic Encryption (SWHE), which are important pillars for achieving FHE. Then, the main FHE families, which have become the base for the other follow-up FHE schemes, are presented. Furthermore, the implementations and recent improvements in Gentry-type FHE schemes are also surveyed. Finally, further research directions are discussed. This survey is intended to give a clear knowledge and foundation to researchers and practitioners interested in knowing, applying, and extending the state-of-the-art HE, PHE, SWHE, and FHE systems.

Cryptography and Data SecurityComplexity and Algorithms in GraphsCoding theory and cryptographyHomomorphic encryptionComputer scienceEncryptionComputer securityHomomorphic secret sharingCloud computingClient-side encryptionKey (lock)On-the-fly encryptionInternet privacy

Funding

  • National Science Foundation
  • Silicon Valley Community Foundation
  • Cisco Systems
  • European Commission
  • Horizon 2020 Framework Programme
  • Fourth Framework Programme
Citations
1,207
FWCI
54.15
field-weighted impact
References
185
Percentile
100%
vs. same field & year
Citations per year
References
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM · 1983 · 13,110 citations
The Design and Implementation of FFTW3
Proceedings of the IEEE · 2005 · 5,062 citations
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory · 1985 · 7,972 citations
New directions in cryptography
IEEE Transactions on Information Theory · 1976 · 14,351 citations
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM · 1978 · 12,940 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.