Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems
ACM Computing Surveys · 2026-08-30 · 58 (11) · 1-27
DOI: 10.1145/3797902 ↗At a glance
Systematische Übersicht in ACM Computing Surveys, published online on 2026-04-21. Written by Julen Bernabé-Rodríguez and 3 co-authors. Cited 1 times so far (Crossref); 69 references.
Abstract (original language)
Fully Homomorphic Encryption (FHE) enables arbitrary computations on encrypted data but lacks mechanisms to ensure the integrity of those computations. In particular, verifying that algorithm inputs are correct or that the intended algorithm was indeed executed remains an open challenge. This article addresses the issue by making two key contributions. First, we perform a comprehensive analysis of integrity faults in FHE, culminating in the definition of verifiable FHE as a novel concept to tackle these concerns. Second, we present a systematic review of existing approaches aimed at providing verifiable FHE, assessing their strengths and weaknesses, as well as their applicability in practical settings. Our findings reveal that, despite promising advances, significant gaps persist in both the theoretical foundations and the practical deployment of verifiable FHE. We conclude by outlining future research directions necessary to achieve verifiable FHE computations.
Cite
APA
Bernabé-Rodríguez, J., Serrano, O. L., Burgo, J. A., & Taquet, E. J. (2026). Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems. ACM Computing Surveys, 58(11), 1-27. https://doi.org/10.1145/3797902
Vancouver
Bernabé-Rodríguez J, Serrano OL, Burgo JA, Taquet EJ. Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems. ACM Computing Surveys. 2026;58(11):1-27. doi:10.1145/3797902
BibTeX
@article{BernabRodrguez2026,
author = {Bernabé-Rodríguez, Julen and Serrano, Oscar Lage and Burgo, Jasone Astorga and Taquet, Eduardo Jacob},
title = {Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems},
journal = {ACM Computing Surveys},
year = {2026},
volume = {58},
number = {11},
pages = {1--27},
doi = {10.1145/3797902}
}
EUVIMED