Linear Communication in Malicious Majority MPC
S. Dov Gordon, Phi Hung Le, Daniel McVicker
2023Year
Abstract
The SPDZ multiparty computation protocol :DPSZ12 allows n parties to securely compute arithmetic circuits over a finite field, while tolerating up to n-1 active corruptions. A line of work building upon SPDZ has made considerable improvement to the protocol's performance, typically focusing on concrete efficiency. However, the communication complexity of each of these protocols is Ømega(n^2|C|).
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 92dbb149-9599-47a2-b147-1bed50a1ad8bRelated papers
- Generalizing the SPDZ Compiler For Other ProtocolsToshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller et al.CCS 2018 · 54 citations
- Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest MajorityAnders P. K. Dalskov, Daniel Escudero, Ariel NofCCS 2022 · 17 citations
- MP-SPDZ: A Versatile Framework for Multi-Party ComputationMarcel KellerCCS 2020 · 24 citations
- Actively Secure MPC with O(|C|) Computation and Communication via CRTAlexander Bienstock, Daniel Escudero, Antigoni PolychroniadouCRYPTO 2026
- Unconditional Communication-Efficient MPC via Hall's Marriage TheoremVipul Goyal, Antigoni Polychroniadou, Yifan SongCRYPTO 2021 · 35 citations
