# Reliability Analysis of Fully Homomorphic Encryption Systems Under Memory Faults

arXiv: https://arxiv.org/abs/2509.20686 · HTML: https://mlsanity.com/paper/2509.20686/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Sep 2025.

## Built on by (most cited first, 1 of 1)

- [PRISM: Sensitivity-Aware PolynoMial PRuning for EffIcient Neural Network Encryption](https://mlsanity.com/paper/2607.18342/) (2026)

## Abstract (arXiv)

Fully Homomorphic Encryption (FHE) represents a paradigm shift in cryptography, enabling computation directly on encrypted data and unlocking privacy-critical computation. Despite being increasingly deployed in real platforms, the reliability aspects of FHE systems, especially how they respond to faults, have been mostly neglected. This paper aims to better understand of how FHE computation behaves in the presence of memory faults, both in terms of individual operations as well as at the level of applications, for different FHE schemes. Finally, we investigate how effective traditional and FHE-specific fault mitigation techniques are.