Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
复制标题
DOI：
10.1007/978-3-642-14623-7_30
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
I. Damgård;Claudio Orlandi
中科院分区：
文献类型：
--
作者：
I. Damgård;Claudio Orlandi
多方计算协议已经有二十多年的历史了，但由于其缺乏效率，其在实际应用中的应用仍然受到限制：本文的目标是设计高效的双方和多方计算协议，旨在填补理论与实践之间的空白。我们提出了一种新的协议来安全评估无功算术电路，该协议在通用可组合安全框架中提供了针对主动对手的安全性。与“执行-编译”方法（各方使用零知识证明来显示他们遵循协议）不同，我们的关键成分是“剪切-选择”技术的有效版本，它允许我们仅通过（少量）恒定的工作量来实现主动安全性，而不是被动安全性。
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal of this paper is the design of efficient two and multi party computation protocols aimed to fill the gap between theory and practice. We propose a new protocol to securely evaluate reactive arithmetic circuits, that offers security against an active adversary in the universally composable security framework. Instead of the “do-and-compile” approach (where the parties use zero-knowledge proofs to show that they are following the protocol) our key ingredient is an efficient version of the “cut-and-choose” technique, that allow us to achieve active security for just a (small) constant amount of work more than for passive security.