TL;DR
This paper introduces a space switching method for fully homomorphic encryption that efficiently combines arithmetic and comparison operations, significantly improving performance over previous approaches.
Contribution
It proposes a novel space switching technique that seamlessly integrates arithmetic and comparison in FV-style schemes, overcoming limitations of prior methods.
Findings
Achieves up to 17× faster performance than scheme switching.
Achieves up to 15× faster comparison than direct methods.
Demonstrates practicality for real-world privacy-preserving applications.
Abstract
Fully homomorphic encryption (FHE) enables computation on encrypted data without decryption, making it central to privacy-preserving applications. However, no existing scheme efficiently supports both arithmetic and comparison operations in a unified framework. Prior approaches such as scheme switching and polynomial approximation face serious limitations: switching incurs prohibitive overhead for large inputs, while approximation methods introduce errors near critical points, restricting use in accuracy-sensitive tasks. We propose space switching method to integrate arithmetic and comparison computation seamlessly within FV-style schemes. Our approach identifies that the two types of operations require different plaintext spaces and introduces two procedures: a reduction step to transition from the number space to the digit space , and a…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
