Cryptology ePrint Archive: Report 2020/1412

Constant-Overhead Unconditionally Secure Multiparty Computation over Binary Fields

Antigoni Polychroniadou and Yifan Song

Abstract: We study the communication complexity of unconditionally secure multiparty computation (MPC) protocols in the honest majority setting. Despite tremendous efforts in achieving efficient protocols for binary fields under computational assumptions, there are no efficient unconditional MPC protocols in this setting. In particular, there are no $n$-party protocols with constant overhead admitting communication complexity of $O(n)$ bits per gate. Cascudo, Cramer, Xing and Yuan (CRYPTO 2018) were the first ones to achieve such an overhead in the amortized setting by evaluating $O(\log n)$ copies of the same circuit in the binary field in parallel. In this work, we construct the first unconditional MPC protocol secure against a malicious adversary in the honest majority setting evaluating just a single boolean circuit with amortized communication complexity of $O(n)$ bits per gate.

Category / Keywords: applications / Multiparty Computation, Information-theoretic Cryptography, Communication Complexity

Original Publication (with major differences): IACR-EUROCRYPT-2021

Date: received 12 Nov 2020, last revised 4 Mar 2021

Contact author: antigonipoly at gmail com, yifans2 at andrew cmu edu

Available format(s): PDF | BibTeX Citation

Version: 20210304:204419 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]