Welcome to the resource topic for 2021/834
Title:
Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem
Authors: Vipul Goyal, Antigoni Polychroniadou, Yifan Song
Abstract:The best known n party unconditional multiparty computation protocols with an optimal corruption threshold communicates O(n) field elements per gate. This has been the case even in the semi-honest setting despite over a decade of research on communication complexity in this setting. Going to the slightly sub-optimal corruption setting, the work of Damgard, Ishai, and Kroigaard (EUROCRYPT 2010) provided the first protocol for a single circuit achieving communication complexity of O(\log|C|) elements per gate. While a number of works have improved upon this result, obtaining a protocol with O(1) field elements per gate has been an open problem. In this work, we construct the first unconditional multi-party computation protocol evaluating a single arithmetic circuit with amortized communication complexity of O(1) elements per gate.
ePrint: https://eprint.iacr.org/2021/834
Talk: https://www.youtube.com/watch?v=nvq-Bg5P5Q0
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 .