ReliaFHE: Resilient Design for Fully Homomorphic Encryption Accelerators
Abstract
The significant computational complexity of Fully Homomorphic Encryption (FHE) has prompted numerous accelerator designs. However, existing FHE accelerators often implicitly assume that all computations are executed reliably, overlooking the fact that modern FHE schemes can be highly vulnerable to hardware faults: even a single-bit error in a ciphertext can cascade into widespread plaintext corruption.
Fields of Study & Subjects
Cryptography and Data Security
Cryptographic Implementations and Security
Cryptography and Residue Arithmetic
Publication details
- Journal / source
- Proceedings of the 31st ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2
- Publisher
- ACM
- Pages
- 1605–1621
- Publication date
- 10 March 2026