Load-Balanced Server-Aided MPC in Heterogeneous Computing

Abstract

Most existing MPC protocols consider the homogeneous setting, where all the MPC players are assumed to have identical communication and computation resources. In practice, the player with the least resources often becomes the bottleneck of the entire MPC protocol execution. In this work, we initiate the study of so-called load-balanced MPC in heterogeneous computing. A load-balanced MPC protocol can adjust the workload of each player accordingly to maximize the overall resource utilization. In particular, we propose new notions called composite circuit and composite garbling scheme , and construct two efficient server-aided protocols with malicious security and semi-honest security, respectively. Our maliciously secure protocol is over $400\times $ faster than the authenticated garbling protocol (CCS ’17) and up to $4.3\times $ faster than the state-of-the-art server-aided MPC protocol of Lu et al. (TDSC ’23); our semi-honest protocol is up to $173\times $ faster than the optimized BMR protocol (CCS ’16) and is up to $3.8\times $ faster than the protocol of Lu et al.