17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      A Survey on Homomorphic Encryption Schemes : Theory and Implementation

      1 , 1 , 1 , 2
      ACM Computing Surveys
      Association for Computing Machinery (ACM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Most cited references86

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Protocols for secure computations

          Andrew Yao (1982)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Somewhat practical fully homomorphic encryption

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On data banks and privacy homomorphisms

                Bookmark

                Author and article information

                Journal
                ACM Computing Surveys
                ACM Comput. Surv.
                Association for Computing Machinery (ACM)
                0360-0300
                1557-7341
                September 06 2018
                September 06 2018
                : 51
                : 4
                : 1-35
                Affiliations
                [1 ]Florida International University, USA, Miami, FL
                [2 ]University of Padua, Padua, Italy
                Article
                10.1145/3214303
                acf6dc0c-b6c1-4c1d-a30a-10b6d5a11023
                © 2018

                http://www.acm.org/publications/policies/copyright_policy#Background

                History

                Comments

                Comment on this article