Fast Actively Secure Five-Party Computation with Security Beyond Abort
Fast Actively Secure Five-Party Computation with Security Beyond Abort
复制标题
快速主动保护五方计算，安全性超越中止
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Swati Singla
中科院分区：
文献类型：
--
作者：
Megha Byali;Carmit Hazay;A. Patra;Swati Singla
安全多方计算（MPC）与小人口和诚实的大多数已经引起了关注，特别是由于定制的技术和由此产生的效率，建设可以提供。在这项工作中，我们调查了广泛的安全概念，在五方设置，容忍两个积极的腐败。由于是恒定循环的，我们的协议最适合实时、高延迟的网络，如互联网。在一个最小的设置成对的私人通道，我们提出了有效的实例一致中止（其中所有诚实的各方获得输出或没有他们这样做）和公平性（对手获得其输出，只有当所有诚实的各方也收到它）。由于存在额外的广播信道（已知是必要的），我们提出了一个保证输出交付的构造（任何对抗行为都不能阻止诚实的各方接收输出）。广播通信是最小的并且与电路大小无关。在性能（通信和运行时间）方面，我们的协议比最知名的协议（ACM CCS 2016）产生的开销最小，该协议实现了选择性中止的最低安全性。此外，我们的协议的公平性和一致中止，可以扩展到n方最多的concorn腐败，类似于Alberran等人。超越最流行的诚实多数设置的三方与一个腐败，我们的研究结果表明，实现更强的安全概念的可行性，一个以上的主动腐败的代价不太远，从最不希望的安全选择性中止。
Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. In this work, we investigate a wide range of security notions in the five-party setting, tolerating two active corruptions. Being constant-round, our protocols are best suited for real-time, high latency networks such as the Internet. In a minimal setting of pairwise-private channels, we present efficient instantiations with unanimous abort (where either all honest parties obtain the output or none of them do) and fairness (where the adversary obtains its output only if all honest parties also receive it). With the presence of an additional broadcast channel (known to be necessary), we present a construction with guaranteed output delivery (where any adversarial behaviour cannot prevent the honest parties from receiving the output). The broadcast communication is minimal and independent of circuit size. In terms of performance (communication and run time), our protocols incur minimal overhead over the best known protocol of Chandran et al. (ACM CCS 2016) that achieves the least security of selective abort. Further, our protocols for fairness and unanimous abort can be extended to n-parties with at most √n corruptions, similar to Chandran et al. Going beyond the most popular honest-majority setting of three parties with one corruption, our results demonstrate feasibility of attaining stronger security notions for more than one active corruption at an expense not too far from the least desired security of selective abort.