Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier

By Toshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein. 2017

139 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

In Computational Theory and Mathematics

Citations in the corpus

Secure Evaluation of Quantized Neural Networks (2019, methodology): “[3], which is based on replicated secret sharing, and we primarily employ it in the ring defined by arithmetic modulo 264.”
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications (2018, methodology): “using linear secret sharing. SPDZ [34] is a secure computation protocol based on additive secret sharing that is secure against n −1 corrupted computation nodes in the malicious model. Recent work of [3, 4, 43] introduces an efficient protocol for three-party secure computation. In general, for secr”
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation (2018, result): “Indeed the throughput and latency one can now achieve for so-called oblivious evaluation of AES is a major improvement over initial results [39].”
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority (2017, methodology): “However, for small elds like GF [28], for example, it is a hybrid of techniques from [1] and Section 4.”
Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning (2019, background): “Similar setup for the three-party case can be found in [4], [5], [11], [12], [25].”
Generalizing the SPDZ Compiler For Other Protocols (2018, methodology): “, compare the ring version of [3] to [24]).”
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, background): “To date, the best protocols communicate: 2 field elements per multiplication gate per party over large fields (size comparable to 2σ for statistical security parameter σ) [40,101], or alternatively 7 bits per multiplication gate per party for Boolean circuits [4] (improving on 10 bits in [65]).”
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation (2020, background): “MPC protocols can be broadly classified into two categories: i) low-latency [30, 49, 78, 85] and ii) highthroughput [4, 29, 32, 33, 71, 87] protocols.”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, methodology): “Araki et al. (2016) propose a secret sharing scheme that is a variant of”