Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
复制标题
具有可识别中止和公共可验证性的高效恒定轮 MPC
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Eduardo Soria
中科院分区：
文献类型：
--
作者：
Carsten Baum;Emmanuela Orsini;Peter Scholl;Eduardo Soria
近年来，人们对安全多方计算(MPC)及其应用的兴趣有了巨大的增长。虽然在效率方面已经取得了很大的进展，但许多当前最先进的协议仍然容易受到拒绝服务攻击，在拒绝服务攻击中，作弊方可能会阻止诚实方获取计算结果，同时保持匿名。可识别中止的安全模型旨在防止这些攻击，允许诚实的各方就作弊方的身份达成一致，然后在未来可以将其排除在外。几个现有的MPC协议提供了针对不诚实的大多数受损方的可识别中止的安全性。然而，所有这些协议都具有随着电路深度线性扩展的轮次复杂性(因此不适合在高延迟网络中使用)，或者使用具有高计算开销的加密原语或技术。
Recent years have seen a tremendous growth in the interest in secure multiparty computation (MPC) and its applications. While much progress has been made concerning its efficiency, many current, state-of-the-art protocols are vulnerable to Denial of Service attacks, where a cheating party may prevent the honest parties from learning the output of the computation, whilst remaining anonymous. The security model of identifiable abort aims to prevent these attacks, by allowing honest parties to agree upon the identity of a cheating party, who can then be excluded in the future. Several existing MPC protocols offer security with identifiable abort against a dishonest majority of corrupted parties. However, all of these protocols have a round complexity that scales linearly with the depth of the circuit (and are therefore unsuitable for use in high latency networks) or use cryptographic primitives or techniques that have a high computational overhead.