Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as well as correctness of the output are guaranteed. Of special importance both in cryptography and in complexity theory is the setting of information-theoretic MPC, where (dishonest) players are unbounded, and no cryptographic assumptions are used. In this setting, it was known since the 1980’s that an honest majority of players is both necessary and sufficient to achieve privacy and correctness. The main open question that was left in this area is to establish the exact communication complexity of MPC protocols that can tolerate malicious behavior of a minority of dishonest players. In all works, there was a large gap between the communication complexity of the best known protocols in the malicious setting and the “honest-but-curious” setting, where players do not deviate from the protocol. In this paper, ...

• Type: Journal
• Year: 2011
• Where: IACR
• Authors: Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
• Keywords: Communication Complexity, Complexity Theory, IACR 2011, Multiparty Computation