Linear Communication in Malicious Majority MPC
S. Dov Gordon, Phi Hung Le, Daniel McVicker
2023年份
摘要
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|).
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Generalizing the SPDZ Compiler For Other ProtocolsToshinori Araki, Assi Barak, Jun Furukawa, Marcel Keller 等CCS 2018 · 被引用 54 次
- Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest MajorityAnders P. K. Dalskov, Daniel Escudero, Ariel NofCCS 2022 · 被引用 17 次
- MP-SPDZ: A Versatile Framework for Multi-Party ComputationMarcel KellerCCS 2020 · 被引用 24 次
- 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 次
