Fast and Secure Three-party Computation: The Garbled Circuit Approach
By Payman Mohassel, Mike Rosulek, Ye Zhang. 2015
123 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
- Yehuda Lindell
- Marcel Keller
- David E. Evans
- Ariel Nof
- Dan Boneh
- Thomas Schneider
- Ajith Suresh
- Yang Liu
In Computational Theory and Mathematics
- Yehuda Lindell
- Ariel Nof
- Thomas Schneider
- Assi Barak
- Nigel P. Smart
- Dan Boneh
- Jonathan Katz
- David E. Evans
Citations in the corpus
- Federated Machine Learning (2019, background): “ions. Ref [33] uses MPC protocols for model training and verification without users revealing sensitive data. One of the state-of-the-art SMC framework is Sharemind [8]. Ref [44] proposed a 3PC model [5, 21, 45] with an honest majority and consider security in both semi-honest and malicious assumpti”
- Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “That said, there have been great advances in practical general-purpose MPC protocols of late [12,13,23,45,46,73,89,91,93,98].”
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (2017, background): “We compare our protocol to [18] in detail in Section 6.”
- A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority (2017, background): “The setting of t < n/2 and malicious adversaries was also studied in [1, 31], including implementations.”
- ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation (2020, background): “MPC protocols can be broadly classified into low-latency [28, 46, 74, 81, 97] and high-throughput [4, 27, 30, 31, 67, 84] categories.”
- From Keys to Databases - Real-World Applications of Secure Multi-Party Computation (2018, methodology): “This is accomplished by using a three party MPC protocol [42], which is a minor variant of the protocol which appeared in [43].”
- Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier (2017, background): “We stress, however, that the latency of [22] is much lower than ours, which makes sense given that it follows the garbled circuit approach.”