An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings.
Mark Abspoel, Anders Dalskov, Daniel E. Escudero, Ariel Nof · IACR Cryptology ePrint Archive · 2019
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.