Paper 2017/555

Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion

Fabrice Benhamouda, Hugo Krawczyk, and Tal Rabin


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.

Available format(s)
Publication info
Published by the IACR in CRYPTO 2017
Non-interactive multiparty computationprivate simulatenous messages
Contact author(s)
fabrice benhamouda @ normalesup org
hugo @ ee technion ac il
talr @ us ibm com
2017-06-08: received
Short URL
Creative Commons Attribution


      author = {Fabrice Benhamouda and Hugo Krawczyk and Tal Rabin},
      title = {Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion},
      howpublished = {Cryptology ePrint Archive, Paper 2017/555},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.