Cryptology ePrint Archive: Report 2017/555

Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion

Fabrice Benhamouda and Hugo Krawczyk and Tal Rabin

Abstract: Non-Interactive Multiparty Computations (Beimel et al., Crypto 2014) is a very powerful notion equivalent (under some corruption model) to garbled circuits, Private Simultaneous Messages protocols, and obfuscation. We present robust solutions to the problem of Non-Interactive Multiparty Computation in the computational and information-theoretic models. Our results include the first efficient and robust protocols to compute any function in $NC^1$ for constant-size collusions, in the information-theoretic setting and in the computational setting, to compute any function in $P$ for constant-size collusions, assuming the existence of one-way functions. Our constructions start from a Private Simultaneous Messages construction (Feige, Killian Naor, STOC 1994 and Ishai, Kushilevitz, ISTCS 1997) and transform it into a Non-Interactive Multiparty Computation for constant-size collusions. We also present a new Non-Interactive Multiparty Computation protocol for symmetric functions with significantly better communication complexity compared to the only known one of Beimel et al.

Category / Keywords: Non-interactive multiparty computation, private simulatenous messages

Original Publication (in the same form): IACR-CRYPTO-2017

Date: received 7 Jun 2017

Contact author: fabrice benhamouda at normalesup org,hugo@ee technion ac il,talr@us ibm com

Available format(s): PDF | BibTeX Citation

Version: 20170608:195516 (All versions of this report)

Short URL: ia.cr/2017/555

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]