Cited by 323Cryptography and Data SecurityCloud Data Security SolutionsInternet Traffic Analysis and Secure E-voting

Survey on Fully Homomorphic Encryption, Theory, and Applications

Open access
Marcolla, Chiara, Sucasas, Victor, Manzano, Marc, Bassoli, Riccardo, Fitzek, Frank H. P., Aaraj, Najwa·2022·Proceedings of the IEEE

Published 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jproc.2022.3205665

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Flagged first, then by citations

Cited by

Sorted by citations

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
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