Survey on Fully Homomorphic Encryption, Theory, and Applications
Open accessPublished version of a preprint
Abstract
Data privacy concerns are increasing significantly in the context of the Internet of Things, cloud services, edge computing, artificial intelligence applications, and other applications enabled by next-generation networks. Homomorphic encryption addresses privacy challenges by enabling multiple operations to be performed on encrypted messages without decryption. This article comprehensively addresses homomorphic encryption from both theoretical and practical perspectives. This article delves into the mathematical foundations required to understand fully homomorphic encryption ($\textsf {FHE}$). It consequently covers design fundamentals and security properties of$\textsf {FHE}$and describes the main$\textsf {FHE}$schemes based on various mathematical problems. On a more practical level, this article presents a view on privacy-preserving machine learning using homomorphic encryption and then surveys$\textsf {FHE}$at length from an engineering angle, covering the potential application of$\textsf {FHE}$in fog computing and cloud computing services. It also provides a comprehensive analysis of existing state-of-the-art$\textsf {FHE}$libraries and tools, implemented in software and hardware, and the performance thereof.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In homomorphic computing, data can be processed in encrypted form without deciphering it first.
“In homomorphic computing, data can be processed in encrypted form without the need for deciphering it first.”
From Connecting the dots in trustworthy Artificial Intelligence: From AI principles, ethics, and key requirements to responsible AI systems and regulation (2023) · cites this paper as [48]
Federated learning, homomorphic computing, and differential privacy are examples of privacy-aware technologies in the current AI landscape.
“In order to land down the data privacy requirement into actual technologies, we emphasize the relevance of Federated learning (FL) [46, 47], homomorphic computing [48] and differential privacy (DP) [49] as examples of privacy-aware technologies in the current AI landscape:”
From Connecting the dots in trustworthy Artificial Intelligence: From AI principles, ethics, and key requirements to responsible AI systems and regulation (2023) · cites this paper as [48]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · see citing works
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · see citing works
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250 · see citing works
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · see citing works
HEAX: An Architecture for Computing on Encrypted Data
Riazi, M. S., Laine, K., Pelton, B., & Dai, W. (2019) · arXiv · doi:10.48550/arxiv.1909.09731 · Cited by 26 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Díaz-Rodríguez, N., Del Ser, J., Coeckelbergh, M., López de Prado, M., Herrera-Viedma, E., & Herrera, F. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.101896 · Cited by 800 · see citing works
Ali, S., Wadho, S. A., Yichiet, A., Gan, M. L., & Lee, C. K. (2024) · Egyptian Informatics Journal · doi:10.1016/j.eij.2024.100519 · Cited by 32 · see citing works
- Authors
- Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N.
- Affiliations
- Technology Innovation Institute (AE)
- SandboxAQ (US)
- Technische Universität Dresden (DE)
- Venue
- Proceedings of the IEEE
- Published
- 2022-10
- Volume
- 110
- Issue
- 10
- Pages
- 1572-1609
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W4302734258
- Cited by
- 323
- References
- 5
- Citations by year
- 2026: 104 · 2025: 111 · 2024: 77 · 2023: 29 · 2022: 2
- FWCI
- 18.02
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- Locations
- Proceedings of the IEEE (publishedVersion)
- eRepository Mondragon University (Mondragon University) (submittedVersion)
- Zenodo (CERN European Organization for Nuclear Research) (submittedVersion, cc-by)
- Figshare (submittedVersion, cc-by)
- Funders
- European Commission through the (H2020)
- project Hexa-X (Agreement 101015956)
- Department of Education, Universities and Research of the Basque Country (IT1676-22)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Keywords
- fully homomorphic encryption, data privacy, privacy-preserving machine learning, mathematical foundations of cryptography, security properties, Internet of Things, cloud computing, fog computing, performance evaluation, hardware implementation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review