[Resource Topic] 2021/1594: On the Bottleneck Complexity of MPC with Correlated Randomness

Welcome to the resource topic for 2021/1594

On the Bottleneck Complexity of MPC with Correlated Randomness

Authors: Claudio Orlandi, Divya Ravi, Peter Scholl


At ICALP 2018, Boyle et al. introduced the notion of the bottleneck complexity of a secure multi-party computation (MPC) protocol. This measures the maximum communication complexity of any one party in the protocol, aiming to improve load-balancing among the parties. In this work, we study the bottleneck complexity of MPC in the preprocessing model, where parties are given correlated randomness ahead of time. We present two constructions of bottleneck-efficient MPC protocols, whose bottleneck complexity is independent of the number of parties: 1. A protocol for computing abelian programs, based only on one-way functions. 2. A protocol for selection functions, based on any linearly homomorphic encryption scheme. Compared with previous bottleneck-efficient constructions, our protocols can be based on a wider range of assumptions, and avoid the use of fully homomorphic encryption.

ePrint: https://eprint.iacr.org/2021/1594

Talk: https://www.youtube.com/watch?v=JQPUYv95W0I

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .