An Efficient Secure Three-Party Sorting Protocol with an Honest Majority.

Jun Furukawa, Yehuda Lindell, Ariel Nof +1 more

Jun Furukawa, Yehuda Lindell, Ariel Nof +1 more

Mark Abspoel, Anders Dalskov, Daniel E. Escudero +1 more

Multiparty computation (MPC) over rings such as \(\mathbb {Z}_{2^{32}}\) or \(\mathbb {Z}_{2^{64}}\) has received a great deal of attention recently due to its ease of implementation and attractive performance. Several actively secure protocols over these rings have been implemented, for both the dishonest majority setting and the setting of three parties with one corruption. However, in the honest majority setting, no concretely efficient protocol for arithmetic computation over rings has yet been proposed that allows for an arbitrary number of parties.

Peeter Laud, Martin Pettai

Koki Hamada, Ryo Kikuchi, Dai Ikarashi +2 more

Sergey Mihailovich Ratseev, Ольга Ивановна Череватенко

In 2016, the authors Araki T., Furukawa J., Lindell Y., Of A. and Ohara K. introduced a new information-theoretic protocol (and a computationally-secure variant) for secure three- party computation with an honest majority. The protocol has very minimal computation and communication. The authors did not provide a complete protocols. This paper provides complete protocols for secure multiparty computation.