Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries
Ruiyu Zhu, Yan Huang, Darion Cassel
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper6
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 被引用 212 次
- Revisiting Square-Root ORAM: Efficient Random Access in Multi-party ComputationSamee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón 等S&P 2016 · 被引用 124 次
- Faster Malicious 2-Party Secure Computation with Online/Offline Dual ExecutionPeter Rindal, Mike RosulekUSENIX Security 2016 · 被引用 63 次
- Secure Stable Matching at ScaleJack Doerner, David Evans, Abhi ShelatCCS 2016 · 被引用 61 次
- Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGOJesper Buus Nielsen, Thomas Schneider, Roberto TrifilettiNDSS 2017 · 被引用 57 次
相关 Paper
- MacORAMa: Optimal Oblivious RAM with IntegritySurya Mathialagan, Neekon VafaCRYPTO 2023 · 被引用 5 次
- LevioSA: Lightweight Secure Arithmetic ComputationCarmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan VenkitasubramaniamCCS 2019 · 被引用 35 次
- 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 等CCS 2020 · 被引用 11 次
- DUPLO: Unifying Cut-and-Choose for Garbled CircuitsVladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu 等CCS 2017 · 被引用 38 次
