NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation
Ruiyu Zhu, Darion Cassel, Amr Sabry, Yan Huang
Abstract
Existing actively-secure MPC protocols require either linear rounds or linear space. Due to this fundamental space-round dilemma, no existing MPC protocols is able to run large-scale computations without significantly sacrificing performance. To mitigate this issue, we developed nanoPI, which is practically efficient in terms of both time and space. Our protocol is based on WRK [44, 45] but introduces interesting and necessary modifications to address several important programmatic and cryptographic challenges. A technique that may be of independent interest (in transforming other computation-oriented cryptographic protocols) is a staged execution model, which we formally define and realize using a combination of lightweight static and dynamic program instrumentation. We demonstrate the unprecedented scalability and performance of nanoPI by building and running a suit of benchmark applications, including an actively-secure four-party logistical regression (involving 4.7 billion ANDs and 8.9 billion XORs) which finished in less than 28 hours on four small-memory machines. Our integrated framework nanoPI is open-sourced at https: //github.com/nanoPIMPC/nanoPI .
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 0f8ac990-c137-41ba-b2bd-bdeecfe18cf5Cited by top-tier papers3
- MAGE: Nearly Zero-Cost Virtual Memory for Secure ComputationSam Kumar, David E. Culler, Raluca Ada PopaOSDI 2021 · 24 citations
- More Efficient MPC from Improved Triple Generation and Authenticated GarblingKang Yang, Xiao Wang, Jiang ZhangCCS 2020 · 5 citations
- Osprey: Transparent and Efficient Virtual Memory for Secure ComputationYicheng Liu, Alice Yeh, Harry Xu, Raluca Ada Popa et al.OSDI 2026
Builds on9
- SecureML: A System for Scalable Privacy-Preserving Machine LearningPayman Mohassel, Yupeng ZhangS&P 2017 · 2,107 citations
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 487 citations
- Global-Scale Secure Multiparty ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 220 citations
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 212 citations
- Faster Malicious 2-Party Secure Computation with Online/Offline Dual ExecutionPeter Rindal, Mike RosulekUSENIX Security 2016 · 63 citations
Related papers
- Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input SizeSeunghwan Lee, Jaesang Noh, Taejeong Kim, Dohyuk Kim et al.CRYPTO 2025 · 1 citation
- The Round Complexity of Perfect MPC with Active Security and Optimal ResiliencyBenny Applebaum, Eliran Kachlon, Arpita PatraFOCS 2020 · 19 citations
- Pool: Scalable On-Demand Secure Computation Service Against Malicious AdversariesRuiyu Zhu, Yan Huang, Darion CasselCCS 2017 · 11 citations
- Malicious Security for SCALES - Outsourced Computation with Ephemeral ServersAnasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj PrabhakaranCRYPTO 2024 · 7 citations
- Trident: Efficient 4PC Framework for Privacy Preserving Machine LearningHarsh Chaudhari, Rahul Rachuri, Ajith SureshNDSS 2020
