FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption
Not on the map. Why?
Abstract (arXiv)
FHE offers protection to private data on third-party cloud servers by allowing computations on the data in encrypted form. However, to support general-purpose encrypted computations, all existing FHE schemes require an expensive operation known as bootstrapping. Unfortunately, the computation cost and the memory bandwidth required for bootstrapping add significant overhead to FHE-based computations, limiting the practical use of FHE. In this work, we propose FAB, an FPGA-based accelerator for bootstrappable FHE. Prior FPGA-based FHE accelerators have proposed hardware acceleration of basic FHE primitives for impractical parameter sets without support for bootstrapping. FAB, for the first time ever, accelerates bootstrapping (along with basic FHE primitives) on an FPGA for a secure and practical parameter set. The key contribution of our work is to architect a balanced FAB design, which is not memory bound. To this end, we leverage recent algorithms for bootstrapping while being cognizant of the compute and memory constraints of our FPGA. We use a minimal number of functional units for computing, operate at a low frequency, leverage high data rates to and from main memory, utilize the limited on-chip memory effectively, and perform operation scheduling carefully. For bootstrapping a fully-packed ciphertext, while operating at 300 MHz, FAB outperforms existing state-of-the-art CPU and GPU implementations by 213x and 1.5x respectively. Our target FHE application is training a logistic regression model over encrypted data. For logistic regression model training scaled to 8 FPGAs on the cloud, FAB outperforms a CPU and GPU by 456x and 6.5x and provides competitive performance when compared to the state-of-the-art ASIC design at a fraction of the cost.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Jul 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 1; 2026: 1.
5 papers.
- 2023HyPHEN: A Hybrid Packing Method and Optimizations for Homomorphic Encryption-Based Neural Networkscited by 9
- 2023GPU-based Private Information Retrieval for On-Device Machine Learning Inferencecited by 5
- 2025Leveraging ASIC AI Chips for Homomorphic Encryptioncited by 3
- 2023Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inferencecited by 2
- 2026OptiPrime: Optimizing Private Inference through Protocol-Hardware Co-designcited by 0
- 2026OptiPrime: Optimizing Private Inference through Protocol-Hardware Co-design15 Sep 2026
- 2025Leveraging ASIC AI Chips for Homomorphic Encryption13 Jan 2025
- 2023Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inference9 Sep 2023
- 2023HyPHEN: A Hybrid Packing Method and Optimizations for Homomorphic Encryption-Based Neural Networks5 Feb 2023
- 2023GPU-based Private Information Retrieval for On-Device Machine Learning Inference26 Jan 2023