Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries
Ruiyu Zhu, Yan Huang, Darion Cassel
Abstract
This paper considers the problem of running a long-term on-demand service for executing actively-secure computations. We examined state-of-the-art tools and implementations for actively-secure computation and identified a set of key features indispensable to offer meaningful service like this. Since no satisfactory tools exist for the purpose, we developed Pool, a new tool for building and executing actively-secure computation protocols at extreme scales with nearly zero offline delay. With Pool, we are able to obliviously execute, for the first time, reactive computations like ORAM in the malicious threat model. Many technical benefits of Pool can be attributed to the concept of pool-based cut-and-choose. We show with experiments that this idea has significantly improved the scalability and usability of JIMU [38] , a state-of-the-art LEGO protocol.
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 5fa8ceff-e2e9-4656-a654-ad987601a22eCited by top-tier papers1
Ask how each one uses itBuilds on6
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 212 citations
- Revisiting Square-Root ORAM: Efficient Random Access in Multi-party ComputationSamee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón et al.S&P 2016 · 124 citations
- Faster Malicious 2-Party Secure Computation with Online/Offline Dual ExecutionPeter Rindal, Mike RosulekUSENIX Security 2016 · 63 citations
- Secure Stable Matching at ScaleJack Doerner, David Evans, Abhi ShelatCCS 2016 · 61 citations
- Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGOJesper Buus Nielsen, Thomas Schneider, Roberto TrifilettiNDSS 2017 · 57 citations
Related papers
- MacORAMa: Optimal Oblivious RAM with IntegritySurya Mathialagan, Neekon VafaCRYPTO 2023 · 5 citations
- LevioSA: Lightweight Secure Arithmetic ComputationCarmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan VenkitasubramaniamCCS 2019 · 35 citations
- Pool: A Practical OT-based OPRF from Learning with RoundingAlex Davidson, Amit Deo, Louis Tremblay ThibaultCCS 2025
- Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PCJackson Abascal, Mohammad Hossein Faghihi Sereshgi, Carmit Hazay, Yuval Ishai et al.CCS 2020 · 11 citations
- DUPLO: Unifying Cut-and-Choose for Garbled CircuitsVladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu et al.CCS 2017 · 38 citations
