Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems
Open Access
- 21 April 2026
- journal article
- review article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (11) , 1-27
Abstract
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.Keywords
This publication has 51 references indexed in Scilit:
- Citation tracking for systematic literature searching: A scoping reviewResearch Synthesis Methods, 2023
- Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments2021
- Flexible and Efficient Verifiable Computation on Encrypted Data2021
- Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings2020
- Practical Product Proofs for Lattice Commitments2020
- Boosting Verifiable Computation on Encrypted Data2020
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy2020
- Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs2019
- Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts2019
- Verifiable Encryption2011