MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More

ePrint Report: MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More

Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, Divya Ravi

The bottleneck-complexity (BC) of secure multiparty computation (MPC) protocols is a measure of the maximum number of bits which are sent and received by any party in a protocol. As the name suggests, the goal of studying BC-efficient protocols is to increase overall efficiency by making sure that the workload in the protocol is somehow "amortized'' by the protocol participants.


Orlandi et …

bits complexity computation eprint report information low measure mpc name party protocol protocols report secure multiparty computation security