SAQE: Practical Privacy-Preserving Approximate Query Processing for Data Federations
Johes Bater, Yongjoo Park, Xi He, Xiao Wang, Jennie Rogers
Abstract
A private data federation enables clients to query the union of data from multiple data providers without revealing any extra private information to the client or any other data providers. Unfortunately, this strong end-to-end privacy guarantee requires cryptographic protocols that incur a significant performance overhead as high as 1,000× compared to executing the same query in the clear. As a result, private data federations are impractical for common database workloads. This gap reveals the following key challenge in a private data federation: offering significantly fast and accurate query answers without compromising strong end-to-end privacy. To address this challenge, we propose SAQE, the Secure Approximate Query Evaluator, a private data federation system that scales to very large datasets by combining three techniques -differential privacy, secure computation, and approximate query processing -in a novel and principled way. First, SAQE adds novel secure sampling algorithms into the federation's query processing pipeline to speed up query workloads and to minimize the noise the system must inject into the query results to protect the privacy of the data. Second, we introduce a query planner that jointly optimizes the noise introduced by differential privacy with the sampling rates and resulting error bounds owing to approximate query processing. Our research shows that these three techniques are synergistic: sampling within certain accuracy bounds improves both query privacy and performance, meaning that SAQE executes over less data than existing techniques without sacrificing efficiency, privacy, or accuracy. Using our optimizer, we leverage this counter-intuitive result to identify an inflection point that maximizes all three criteria prior query evaluation. Experimentally, we show that this result enables SAQE to trade-off among these three criteria to scale its query processing to very large datasets with accuracy bounds dependent only on sample size, and not the raw data size.
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 184cd869-49f2-44dd-8a9f-9170187fda51Cited by top-tier papers26
- Hu-Fu: Efficient and Secure Spatial Queries over Data FederationYongxin Tong, Xuchen Pan, Yuxiang Zeng, Yexuan Shi et al.VLDB 2022 · 63 citations
- SECRECY: Secure collaborative analytics in untrusted cloudsJohn Liagouris, Vasiliki Kalavri, Muhammad Faisal, Mayank VariaNSDI 2023 · 53 citations
- Equitable Data Valuation Meets the Right to Be Forgotten in Model MarketsHaocheng Xia, Jinfei Liu, Jian Lou, Zhan Qin et al.VLDB 2023 · 28 citations
- Data-Sharing Markets: Model, Protocol, and Algorithms to Incentivize the Formation of Data-Sharing ConsortiaRaul Castro FernandezSIGMOD 2023 · 28 citations
- PrivLava: Synthesizing Relational Data with Foreign Keys under Differential PrivacyKuntai Cai, Xiaokui Xiao, Graham CormodeSIGMOD 2023 · 25 citations
Builds on7
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan et al.CCS 2016 · 7,620 citations
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone et al.CCS 2017 · 3,936 citations
- Composing Differential Privacy and Secure Computation: A Case Study on Scaling Private Record LinkageXi He, Ashwin Machanavajjhala, Cheryl J. Flynn, Divesh SrivastavaCCS 2017 · 115 citations
- OptORAMa: Optimal Oblivious RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak et al.EUROCRYPT 2020 · 92 citations
- Crypt?: Crypto-Assisted Differential Privacy on Untrusted ServersAmrita Roy Chowdhury, Chenghong Wang, Xi He, Ashwin Machanavajjhala et al.SIGMOD 2020 · 40 citations
Related papers
- U-DPAP: Utility-aware Efficient Range Counting on Privacy-preserving Spatial Data FederationYahong Chen, Xiaoyi Pang, Xiaoguang Li, Hanyi Wang et al.SIGMOD 2025 · 2 citations
- DP-S4S: Accurate and Scalable Select-Join-Aggregate Query Processing with User-Level Differential PrivacyYuan Qiu, Xiaokui Xiao, Yin YangSIGMOD 2026
- Alchemy: A Query Optimization Framework for Oblivious SQLDonghyun Sohn, Kelly Jiang, Nicolas Hammer, Jennie RogersVLDB 2025 · 2 citations
- Secure Sampling for Approximate Multi-party Query ProcessingQiyao Luo, Yilei Wang, Ke Yi, Sheng Wang et al.SIGMOD 2024 · 3 citations
- SPECIAL: Synopsis Assisted Secure Collaborative AnalyticsChenghong Wang, Lina Qiu, Johes Bater, Yukui LuoVLDB 2025 · 3 citations
