Perfectly-Secure MPC with Linear Communication Complexity

By Zuzana Beerliová-Trubíniová, Martin Hirt. 2008

251 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

Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning (2020, background): “Their main bottleneck is the high communication cost, and communication-efficient implementations require an extensive offline computation part [19], [20].”
Secure Computation on Floating Point Numbers (2013, background): “The above is normally achieved using a verifiable secret sharing scheme (VSS), and a large number of results have been developed over the years (e.g., [27], [29], [11], [22], [21] and others).”
CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning (2019, methodology): “Given our choice of r = 1, we consider two cases: • 3, which shows the comparison of CodedPrivateML with the [BH08] protocol from [11], as we have found it to be the faster of the two benchmarks.”
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users (2010, background): “Some protocols achieve nearly optimal asymptotic complexity [3, 16] while some work in small field [12].”
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority (2017, methodology): “) Thus, techniques like those used in [6] do not apply to our case.”
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (2012, background): “active t < n/3 unconditional O(cMn (2)κ) + poly(nκ) [18] active t < n/3 unconditional O(cMn log n+ dMn 2 log n) + poly(nκ) [16] active t < n/3 perfect O(cMn log n+ dMn 2 log n+ n(3) log n) [4]”
A Scalable Approach for Privacy-Preserving Collaborative Machine Learning (2020, methodology): “Our results are demonstrated in Figure 3, which shows the comparison of COPML with the protocol from [3], as we have found it to be the faster of the two baselines.”