A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority
By Yehuda Lindell, Ariel Nof. 2017
110 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Marcel Keller
- Yehuda Lindell
- Assi Barak
- Daniel E. Escudero
- Anders Dalskov
- Toshinori Araki
- Kazuma Ohara
- Jun Furukawa
In Computational Theory and Mathematics
- Marcel Keller
- Assi Barak
- Yehuda Lindell
- Daniel E. Escudero
- Anders Dalskov
- Nishanth Chandran
- Divya Gupta
- Jun Furukawa
Citations in the corpus
- Secure Evaluation of Quantized Neural Networks (2019, methodology): “• PsReplicated2k : This protocol by Eerikson et al. [21] is an extension of the one by Lindell et al. [46] to the ring setting.”
- Generalizing the SPDZ Compiler For Other Protocols (2018, methodology): “The multiplication was changed, but so was scalar addition since in the SPDZ protocol each party carries out the same operation locally, whereas different parties act differently for scalar addition in the replicated secretsharing protocol version of [24].”
- SecureNN: 3-Party Secure Computation for Neural Network Training (2019, background): “Secure multi-party computation (MPC) [8, 17, 25, 40] and specifically 3-party computation [6, 9, 10, 14, 18, 23, 28, 32] provide a generic solution for the above problem.”