论文标题
重新审视对一般对手的异步多方计算的效率
Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries
论文作者
论文摘要
在本文中，我们设计了具有最佳弹性的异步通信设置中的安全多方计算（MPC）协议。我们的协议可与计算上的恶意对手相抵触，其特征在于对手结构$ \ Mathcal {z} $，该{z} $列举了所有可能腐败各方的所有可能子集。我们的协议产生了$ \ MATHCAL {O}（| \ MATHCAL {Z} |^2）$和$ \ MATHCAL {O}（| \ Mathcal {Z} |）$ bits $ bits $ bits $ perfect for Perfect和统计安全性。这些是具有这种通信复杂性的第一个协议，因为此类协议仅在同步通信设置中才知道（Hirt和Tschudi，Asiacrypt 2013）。
In this paper, we design secure multi-party computation (MPC) protocols in the asynchronous communication setting with optimal resilience. Our protocols are secure against a computationally-unbounded malicious adversary, characterized by an adversary structure $\mathcal{Z}$, which enumerates all possible subsets of potentially corrupt parties. Our protocols incur a communication of $\mathcal{O}(|\mathcal{Z}|^2)$ and $\mathcal{O}(|\mathcal{Z}|)$ bits per multiplication for perfect and statistical security respectively. These are the first protocols with this communication complexity, as such protocols were known only in the synchronous communication setting (Hirt and Tschudi, ASIACRYPT 2013).
