BoostCom: Towards Efficient Universal Fully Homomorphic Encryption by Boosting the Word-wise Comparisons
Ardhi Wiratama Baskara Yudha, Jiaqi Xue, Qian Lou, Huiyang Zhou and, Yan Solihin

TL;DR
BoostCom significantly accelerates word-wise comparison operations in universal fully homomorphic encryption systems, achieving over 11 times speedup through infrastructure and algorithm optimizations, thereby enhancing privacy-preserving computation efficiency.
Contribution
The paper introduces BoostCom, a novel scheme that accelerates comparison operations in uFHE by combining multi-level parallelization, GPU enhancements, and algorithm-aware optimizations.
Findings
BoostCom achieves 11.1x speedup over state-of-the-art CPU-based uFHE.
It improves efficiency across various FHE parameters and tasks.
The scheme combines infrastructure and algorithm optimizations for end-to-end performance gains.
Abstract
Fully Homomorphic Encryption (FHE) allows for the execution of computations on encrypted data without the need to decrypt it first, offering significant potential for privacy-preserving computational operations. Emerging arithmetic-based FHE schemes (ar-FHE), like BGV, demonstrate even better performance in word-wise comparison operations over non-arithmetic FHE (na-FHE) schemes, such as TFHE, especially for basic tasks like comparing values, finding maximums, and minimums. This shows the universality of ar-FHE in effectively handling both arithmetic and non-arithmetic operations without the expensive conversion between arithmetic and non-arithmetic FHEs. We refer to universal arithmetic Fully Homomorphic Encryption as uFHE. The arithmetic operations in uFHE remain consistent with those in the original arithmetic FHE, which have seen significant acceleration. However, its non-arithmetic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Coding theory and cryptography · DNA and Biological Computing
