A Survey on Homomorphic Encryption Schemes
By Abbas Acar, Hidayet Aksu, Selcuk Uluagac, Mauro Conti. 2017
1,415 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Privacy & Security
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
- Tianjian Chen
- Zaid Al-Ars
- Andrea Cavallaro
- Yan Kang
- Qiang Yang
- David Enthoven
- Hamed Haddadi
- Mingyi Hong
In Privacy & Security
Citations in the corpus
- Backdoor attacks and defenses in feature-partitioned collaborative learning (2020, background): “Privacy-preserving techniques such as Homomorphic Encryption (HE) (Rivest et al., 1978; Acar et al., 2018), Secure Multi-party Computation (SMPC) (Yao, 1982) and Differential Privacy (DP) (Dwork, 2006) are typically applied in these frameworks to preserve user privacy and data confidentiality.”
- A Communication Efficient Vertical Federated Learning Framework (2019, background): “Existing architectures for VFL still face several critical challenges and communication overhead is a major bottleneck since privacy-preserving computations, such as Homomorphic Encryption (HE) [4, 5] and Multi-party Computation (SMPC) [6], are typically applied to transmitted data, and per-iteratio”
- Federated Machine Learning (2019, background): “s little possibility of leakage at the raw data level. Recent works adopted homomorphic encryption for centralizing and training data on cloud [75, 76]. In practice, Additively Homomorphic Encryption [2] are widely used and polynomial approximations need to be made to evaluate non-linear functions i”
- Secure Federated Matrix Factorization (2019, background): “where E is an encryption algorithm and M is the set of all possible messages [Acar et al., 2018].”
- Privacy preservation in federated learning: An insightful survey from the GDPR perspective (2020, neutral): “operations that can be performed on an encrypted form, homomorphic encryption techniques are divided into different categories such as partial, somewhat (SWHE), and fully homomorphic encryption (FHE) [62]. Some classic encryption techniques, including Rivest–Shamir–Adleman (RSA), is SWHE wherein sim”
- Preserving Data Privacy via Federated Learning: Challenges and Solutions (2020, neutral): “In practice, FHE seems theoretical, and additively homomorphic encryption [5] are widely used to evaluate non-linear functions in machine learning algorithms that require balancing the trade-offs between data privacy and prediction accuracy.”
- An Overview of Federated Deep Learning Privacy Attacks and Defensive Strategies (2020, methodology): “Fully Homomor-phic Encryption (FHE) which allows unlimited amounts of operations without restriction [65].”
- DarkneTZ: towards model privacy at the edge using trusted execution environments (2020, positive): “For example, advanced techniques such as fully homomorphic encryption enable operators to process the encrypted data and models without decryption during deep learning, but significantly increase the computation cost [3, 37].”
- A Communication Efficient Collaborative Learning Framework for Distributed Features (2019, background): “, 3]. Existing architectures for VFL still face several critical challenges and communication overhead is a major bottleneck since privacy-preserving computations, such as Homomorphic Encryption (HE) [4, 5] and Multi-party Computation (SMPC) [6], are typically applied to transmitted data, and per-it”
- Parallel Distributed Logistic Regression for Vertical Federated Learning without Third-Party Coordinator (2019, methodology): “This paper is also related to homomorphic encryption (HE) [Rivest et al., 1978; Paillier, 1999; Acar et al., 2018], a cryptographic method which is widely used in the privacy-preserving machine learning algorithms.”