ORQ: Complex Analytics on Private Data with Strong Security Guarantees
Eli Baum, Sam Buxbaum, Nitin Mathai, Muhammad Faisal, Vasiliki Kalavri, Mayank Varia, John Liagouris
Abstract
We present Orq, a system that enables collaborative analysis of large private datasets using cryptographically secure multiparty computation (MPC). Orq protects data against semi-honest or malicious parties and can efficiently evaluate relational queries with multi-way joins and aggregations that have been considered notoriously expensive under MPC. To do so, Orq eliminates the quadratic cost of secure joins by leveraging the fact that, in practice, the structure of many real queries allows us to join records and apply the aggregations "on the fly" while keeping the result size bounded. On the system side, Orq contributes generic oblivious operators, a data-parallel vectorized query engine, a communication layer that amortizes MPC network costs, and a dataflow API for expressing relational analytics -all built from the ground up. We evaluate Orq in LAN and WAN deployments on a diverse set of workloads, including complex queries with multiple joins and custom aggregations. When compared to state-of-the-art solutions, Orq significantly reduces MPC execution times and can process one order of magnitude larger datasets. For our most challenging workload, the full TPC-H benchmark, we report results entirely under MPC with Scale Factor 10 -a scale that had previously been achieved only with information leakage or the use of trusted compute.
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 ba9dbfd7-a757-49c4-8134-50de3c07d8beCited by top-tier papers2
- C rypt D ough : A Unified Analytics Engine for Secure Multiparty ComputationMuhammad Faisal, Alessandra Lanz, Sam Buxbaum, Adam Godel et al.SOSP 2026
- FLOSS: Fast Linear Online Secret-Shared ShufflingIan Chang, Sela Navot, Alex Ozdemir, Nirvan TyagiUSENIX Security 2026
Builds on31
- CrypTen: Secure Multi-Party Computation Meets Machine LearningBrian Knott, Shobha Venkataraman, Awni Y. Hannun, Shubho Sengupta et al.NeurIPS 2021 · 573 citations
- High-Throughput Semi-Honest Secure Three-Party Computation with an Honest MajorityToshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof et al.CCS 2016 · 463 citations
- Lessons Learned from the Chameleon TestbedKate Keahey, Jason Anderson, Zhuo Zhen, Pierre Riteau et al.USENIX ATC 2020 · 398 citations
- Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious SecurityAnders P. K. Dalskov, Daniel Escudero, Marcel KellerUSENIX Security 2021 · 174 citations
- Pump up the Volume: Practical Database Reconstruction from Volume Leakage on Range QueriesPaul Grubbs, Marie-Sarah Lacharité, Brice Minaud, Kenneth G. PatersonCCS 2018 · 172 citations
Related papers
- SECRECY: Secure collaborative analytics in untrusted cloudsJohn Liagouris, Vasiliki Kalavri, Muhammad Faisal, Mayank VariaNSDI 2023 · 53 citations
- Secure Multi-Party Sampling over JoinsQiyao Luo, Quanqing Xu, Chuanhui YangVLDB 2026
- Efficient Oblivious Database JoinsSimeon Krastnikov, Florian Kerschbaum, Douglas StebilaVLDB 2020 · 57 citations
- Senate: A Maliciously-Secure MPC Platform for Collaborative AnalyticsRishabh Poddar, Sukrit Kalra, Avishay Yanai, Ryan Deng et al.USENIX Security 2021 · 89 citations
- Secure Query Processing with Linear Online CostQiyao Luo, Yilei Wang, Wei Dong, Ke YiICDE 2026
