Reducing input-dependent communication in MPC: a new approach
Researchers introduce a method to reduce input-dependent communication in multi-party computation (MPC) protocols to the final two rounds. This approach enhances efficiency by dividing computation into offline (input-independent) and online (input-dependent) phases, reducing online communication rounds. The work also defines "MPC with Adaptive-Input Selection," ensuring security even when inputs depend on offline messages. This advancement is significant for settings without setup assumptions and with potential dishonest majorities.
blog.succinct.xyz
🔗
Delayed-Input Multi-Party Computation
We consider the problem of minimizing the round of communication required in the online phase and propose a round preserving compiler that can turn a big class of multi-party computation (MPC) protocols into protocols in which only the last two rounds are input-dependent.
Our compiler can be applied to a big class of MPC protocols, and in particular to all existing round-optimal MPC protocols.