Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
复制标题
高效多方计算：通过安全 SIMD 电路从被动安全到主动安全
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Antigoni Polychroniadou
中科院分区：
文献类型：
--
作者：
Daniel Genkin;Yuval Ishai;Antigoni Polychroniadou
密码学中的一个中心问题是将提供针对被动（或半诚实）对手的安全性的协议转换为提供针对主动（或恶意）对手的安全性的协议。这个问题一直是安全多方计算（MPC）领域中大量工作的主题。尽管做出了这些努力，但在这两种情况下，最好的协议之间仍然存在很大的效率差距。在最近的两项工作中，Genkin et al.（STOC 2014）和Ikarashi et al.（ePrint 2014）提出了以下新范式，用于有效地将被动安全MPC协议转换为主动安全协议。他们首先观察到，在几个自然的信息理论MPC协议中，对协议的任意主动攻击可以在一个理想模型中完美地模拟，该模型允许对正在评估的算术电路进行加法攻击。也就是说，允许模拟器通过向每条线添加任意的场元素来（盲目地）修改原始电路。为了防止这种攻击，原来的电路被替换为所谓的AMD电路，它可以提供保护，防止这种攻击与常数乘法开销的大小。
A central problem in cryptography is that of converting protocols that offer security against passive (or semi-honest) adversaries into ones that offer security against active (or malicious) adversaries. This problem has been the topic of a large body of work in the area of secure multiparty computation (MPC). Despite these efforts, there are still big efficiency gaps between the best protocols in these two settings. In two recent works, Genkin et al. (STOC 2014) and Ikarashi et al. (ePrint 2014) suggested the following new paradigm for efficiently transforming passive-secure MPC protocols into active-secure ones. They start by observing that in several natural information-theoretic MPC protocols, an arbitrary active attack on the protocol can be perfectly simulated in an ideal model that allows for additive attacks on the arithmetic circuit being evaluated. That is, the simulator is allowed to (blindly) modify the original circuit by adding an arbitrary field element to each wire. To protect against such attacks, the original circuit is replaced by a so-called AMD circuit, which can offer protection against such attacks with constant multiplicative overhead to the size.