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

By Ronald Cramer, Ivan Damg˚ard, Daniel E. Escudero, Peter Scholl, Chaoping Xing. 2018

How researchers see this paper

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

1. Marcel Keller
2. Assi Barak
3. Daniel E. Escudero
4. Ivan Bjerre Damgård
5. Peter Scholl
6. Anders Dalskov
7. Tore Kasper Frederiksen
8. Yehuda Lindell

Citations in the corpus

• Secure Evaluation of Quantized Neural Networks (2019, methodology): “This is achieved by incorporating ideas by Cramer et al. [13] in order to adapt the post-sacrifice step by Lindell et al. to the ring Z 2 k .”
• New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning (2019, methodology): “This affirms statements made by Cramer et al. [17] that not needing to do modulo reduction of a large prime will have a noticeable impact on practical efficiency.”