SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority

192 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Secure Evaluation of Quantized Neural Networks (2019, neutral): “This result further supports all the recent work that has gone into designing fast protocols that work over a ring [15, 17] (as this ring is typically taken to be integers modulo a power of 2).”
Secure and Efficient Federated Transfer Learning (2019, unknown): “modulo prime, another direction can be an implementation over rings of the form 2 using SPDZ-2k protocol [23].”
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation (2020, unknown): “The works of [38,61] proposed efficient SS-based solutions for the dishonest majority setting over fields, which was then extended to the ring setting in [33].”
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning (2019, methodology): “[17] that not needing to do modulo reduction of a large prime will have a noticeable impact on practical efficiency.”