International Association for Cryptologic Research

International Association
for Cryptologic Research


Order-C Secure Multiparty Computation for Highly Repetitive Circuits

Gabrielle Beck , Johns Hopkins University
Aarushi Goel , Johns Hopkins University
Abhishek Jain , Johns Hopkins University
Gabriel Kaptchuk , Boston University
DOI: 10.1007/978-3-030-77886-6_23 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: EUROCRYPT 2021
Abstract: Running secure multiparty computation (MPC) protocols with hundreds or thousands of players would allow leveraging large volunteer networks (such as blockchains and Tor) and help justify honest majority assumptions. However, most existing protocols have at least a linear (multiplicative) dependence on the number of players, making scaling difficult. Known protocols with asymptotic efficiency independent of the number of parties (excluding additive factors) require expensive circuit transformations that induce large overheads. We observe that the circuits used in many important applications of MPC such as training algorithms used to create machine learning models have a highly repetitive structure. We formalize this class of circuits and propose an MPC protocol that achieves O(|C|) total complexity for this class. We implement our protocol and show that it is practical and outperforms O(n|C|) protocols for modest numbers of players.
Video from EUROCRYPT 2021
  title={Order-C Secure Multiparty Computation for Highly Repetitive Circuits},
  author={Gabrielle Beck and Aarushi Goel and Abhishek Jain and Gabriel Kaptchuk},