Homomorphic encryption (HE) enables computations directly on encrypted data, offering strong cryptographic guarantees for secure and privacy-preserving data storage and query execution. However, despite its theoretical power, practical adoption of HE in database systems remains limited due to extreme ciphertext expansion, memory overhead, and the computational cost of bootstrapping, which resets noise levels for correctness. This paper presents NSHEDB, a secure query processing engine designed to address these challenges at the system architecture level. NSHEDB uses word-level leveled HE (LHE) based on the BFV scheme to minimize ciphertext expansion and avoid costly bootstrapping. It introduces novel techniques for executing equality, range, and aggregation operations using purely homomorphic computation, without transciphering between different HE schemes (e.g., CKKS/BFV↔TFHE) or relying on trusted hardware. Additionally, it incorporates a noise-aware query planner to extend computation depth while preserving security guarantees. We implement and evaluate NSHEDB on real-world database workloads (TPC-H) and show that it achieves 20x–1370x speedup and a 73x storage reduction compared to state-of-the-art HE-based systems, while upholding 128-bit security in a semi-honest model with no key release or trusted components.
Building similarity graph...
Analyzing shared references across papers
Loading...
Boram Jung
Hung‐Wei Tseng
Y Li
Proceedings of the ACM on Management of Data
University of California, Riverside
Menlo School
Alpha Omega Alpha Medical Honor Society
Building similarity graph...
Analyzing shared references across papers
Loading...
Jung et al. (Thu,) studied this question.
www.synapsesocial.com/papers/69d894526c1944d70ce054c3 — DOI: https://doi.org/10.1145/3786671