Homomorphic Encryption Enabling Computation on Encrypted Data for Secure Cloud Computing
-
Published:2024-07-12
Issue:
Volume:
Page:215-240
-
ISSN:1948-9730
-
Container-title:Advances in Information Security, Privacy, and Ethics
-
language:
-
Short-container-title:
Author:
Maqousi Ali1, Alauthman Mohammad1ORCID, Almomani Ammar2ORCID
Affiliation:
1. Petra University, Jordan 2. Skyline University College, UAE
Abstract
Homomorphic encryption enables computations on encrypted data, providing confidentiality for cloud computing applications. This chapter explains the foundations, classifications, and security definitions for homomorphic encryption schemes. Partially and somewhat homomorphic cryptosystems allow limited operations whereas fully homomorphic encryption supports arbitrary depth circuits through bootstrapping. Various homomorphic schemes are presented including RSA, Paillier, learning/ring with errors, Gentry's ideal lattices, and code-based cryptosystems. Their underlying hardness assumptions based on lattices, codes, and number theory are analyzed. Applications of fully homomorphic encryption for secure cloud analytics, machine learning, signal processing, database queries, and information retrieval are described. However, performance overhead remains a key challenge. Recent optimizations using leveled FHE, ciphertext packing, and function approximation aim to improve efficiency. Hardware acceleration via FPGAs and ASICs offers further speedups.
Reference30 articles.
1. Albrecht, M., Chase, M., Chen, H., Ding, J., Goldwasser, S., Gorbunov, S., Halevi, S., Hoffstein, J., Laine, K., Lauter, K., Lokam, S., Micciancio, D., Moody, D., Morrison, T., Sahai, A., & Vaikuntanathan, V. (2018). Homomorphic encryption security standard. HomomorphicEncryption.org, Technical Report. Homomorphic Encryption.org. 2. Benaloh, J. (1994). Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography(pp. 120-128). Research Gate. 3. Private predictive analysis on encrypted medical data 4. Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014). (Leveled) Fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT), 6(3), Article 13. 5. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
|
|