RoundRole: Unlocking the Efficiency of Multi-party Computation with Bandwidth-aware Execution
Xiaoyu Fan, Kun Chen, Jiping Yu, Xin Liu, Yunyi Chen, Wei Xu
Abstract
—In privacy-preserving distributed computation systems like secure multi-party computation (MPC), cross-party communication is the primary bottleneck. Over the past two decades, numerous remarkable protocols have been proposed to reduce the overall communication complexity, substantially narrowing the gap between MPC and plaintext computations. However, these advances often overlook a crucial aspect: the asymmetric communication pattern. This imbalance results in significant bandwidth wastage, thereby “locking” the performance. In this paper, we propose RoundRole , a bandwidth-aware execution optimization for secret-sharing MPC. The key idea is to decouple the logical roles, which determine the communication patterns, from the physical nodes, which determine the band-width. By partitioning the overall protocol into parallel tasks and strategically mapping each logical role to a physical node for each task, RoundRole effectively allocates the communication workload in accordance with the inherent protocol communication volume and the physical bandwidth. This execution-level optimization fully leverages network resources and “unlocks” the efficiency. We integrate RoundRole on top of ABY3, one of the widely used open-source MPC frameworks. Extensive evaluations across nine protocols under six diverse network settings (with homogeneous and heterogeneous bandwidths) demonstrate significant performance improvements, achieving up to 7.1 × speedups.
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.
Builds on23
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 898 citations
- ABY2.0: Improved Mixed-Protocol Secure Two-Party ComputationArpita Patra, Thomas Schneider, Ajith Suresh, Hossein YalameUSENIX Security 2021 · 307 citations
- CryptGPU: Fast Privacy-Preserving Machine Learning on the GPUSijun Tan, Brian Knott, Yuan Tian, David J. WuS&P 2021 · 241 citations
- Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious SecurityAnders P. K. Dalskov, Daniel Escudero, Marcel KellerUSENIX Security 2021 · 174 citations
- BOLT: Privacy-Preserving, Accurate and Efficient Inference for TransformersQi Pang, Jinhao Zhu, Helen Möllering, Wenting Zheng et al.S&P 2024 · 149 citations
Related papers
- Communication Efficient Secret Sharing with Dynamic Communication-Computation ConversionZhenghang Ren, Xiaodian Cheng, Mingxuan Fan, Junxue Zhang et al.INFOCOM 2023 · 3 citations
- Co-Prime: A Co-design Framework for Privacy Preserving Machine Learning on FPGAShuo Xu, Jiming Xu, Pengfei Xue, Xinyao Wang et al.CCS 2025
- Dishonest Majority Multi-party Arithmetic Garbling with Constant RateTianyao Gu, Hanjun Li, Elaine ShiCRYPTO 2026
- SECRECY: Secure collaborative analytics in untrusted cloudsJohn Liagouris, Vasiliki Kalavri, Muhammad Faisal, Mayank VariaNSDI 2023 · 53 citations
- RingSG: Optimal Secure Vertex-Centric Computation for Collaborative Graph ProcessingZhenhua Zou, Zhuotao Liu, Jinyong Shan, Qi Li et al.CCS 2025
