A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings
[article]
2019
IACR Cryptology ePrint Archive
Multiparty computation (MPC) over rings such as Z 2 32 or 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
dblp:journals/iacr/AbspoelDEN19
fatcat:c3h4bowflnefxd5rrsv36omqby