USENIX Security2025Top-tier venue
Engorgio: An Arbitrary-Precision Unbounded-Size Hybrid Encrypted Database via Quantized Fully Homomorphic Encryption
Song Bian, Haowen Pan, Jiaqi Hu, Zhou Zhang, Yunhao Fu, Jiafeng Hua, Yunyi Chen, Bo Zhang, Yier Jin, Jin Dong, Zhenyu Guan
Abstract
This work proposes an encrypted hybrid database framework that combines vectorized data search and relational data query over quantized fully homomorphic encryption (FHE). We observe that, due to the lack of efficient encrypted data ordering capabilities, most existing encrypted database (EDB) frameworks do not support hybrid queries involving both vectorized and relational data. To further enrich query expressiveness while retaining evaluation efficiency, we propose Engorgio, a hybrid EDB framework based on quantized data ordering techniques over FHE. Specifically, we design a new quantized data encoding scheme along with a set of novel comparison and permutation algorithms to accurately generate and apply orders between large-precision data items. Furthermore, we optimize specific query types, including full table scan, batched query, and Top-k query to enhance the practical performance of the proposed framework. In the experiment, we show that, compared to the state-of-the-art EDB frameworks, Engorgio is up to 28×-854× faster in homomorphic comparison, 65×-687× faster in homomorphic sorting and 15×-1, 640× faster over a variety of end-to-end relational, vectorized, and hybrid SQL benchmarks. Using Engorgio, the amortized runtime for executing a relational and hybrid query on a 48-core processor is under 3 and 75 seconds, respectively, over a 10K-row hybrid database.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d5a7f8f8-668c-4a13-84f5-16a2dce35476Cited by top-tier papers2
- Accelerating Confidential Databases with Crypto-Free MappingsWenxuan Huang, Zhanbo Wang, Mingyu LiOSDI 2026
- Libra: Pattern-Scheduling Co-Optimization for Cross-Scheme FHE Code Generation over GPGPUSong Bian, Yintai Sun, Zian Zhao, Haowen Pan et al.USENIX Security 2026
Builds on27
- Retrieval-Augmented Generation for Knowledge-Intensive NLP TasksPatrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni et al.NeurIPS 2020 · 19,162 citations
- EnclaveDB: A Secure Database Using SGXChristian Priebe, Kapil Vaswani, Manuel CostaS&P 2018 · 329 citations
- Generic Attacks on Secure Outsourced DatabasesGeorgios Kellaris, George Kollios, Kobbi Nissim, Adam O'NeillCCS 2016 · 327 citations
- Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse KeysJean-Philippe Bossuat, Christian Mouchet, Juan Ramón Troncoso-Pastoriza, Jean-Pierre HubauxEUROCRYPT 2021 · 179 citations
- PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic EncryptionWen-jie Lu, Zhicong Huang, Cheng Hong, Yiping Ma et al.S&P 2021 · 139 citations
Related papers
- HE3DB: An Efficient and Elastic Encrypted Database Via Arithmetic-And-Logic Fully Homomorphic EncryptionSong Bian, Zhou Zhang, Haowen Pan, Ran Mao et al.CCS 2023 · 46 citations
- ArcEDB: An Arbitrary-Precision Encrypted Database via (Amortized) Modular Homomorphic EncryptionZhou Zhang, Song Bian, Zian Zhao, Ran Mao et al.CCS 2024 · 11 citations
- HEDA: Multi-Attribute Unbounded Aggregation over Homomorphically Encrypted DatabaseXuanle Ren, Le Su, Zhen Gu, Sheng Wang et al.VLDB 2023 · 42 citations
- cuFHEDB: GPU-Accelerated Fully Homomorphic Encryption DatabaseShijie Gao, Feng Zhang, Qian Xu, Yang Li et al.ICDE 2026
- Efficient Ranking, Order Statistics, and Sorting under CKKSFederico Mazzone, Maarten H. Everts, Florian Hahn, Andreas PeterUSENIX Security 2025
