A New Approach to Practical Active-Secure Two-Party Computation
A New Approach to Practical Active-Secure Two-Party Computation
复制标题
DOI：
10.1007/978-3-642-32009-5_40
复制
发表时间：
2012-02
期刊：
影响因子：
--
通讯作者：
J. Nielsen;P. S. Nordholt;Claudio Orlandi;Sai Sheshank Burra
中科院分区：
文献类型：
--
作者：
J. Nielsen;P. S. Nordholt;Claudio Orlandi;Sai Sheshank Burra
我们提出了一种新的实用的两方计算方法，以防止主动对手的攻击。之前所有的实用方案都是基于姚的乱码电路。我们采用了一种基于OT的方法，并在随机oracle模型中通过OT扩展来提高效率。为了得到一个实用的协议，我们引入了一些新的技术来将OTs的输出和输入在一个更大的结构中联系起来。我们还报告了这种方法的实现，这表明我们的协议比以前的任何协议都更有效：对于足够大的电路，我们每秒可以评估超过20000个布尔门。例如，评估一个无关AES加密（门）需要64秒，但是当重复任务27次时，每个实例只需要不到3秒。
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao’s garbled circuits. We use an OT-based approach and get efficiency via OT extension in the random oracle model. To get a practical protocol we introduce a number of novel techniques for relating the outputs and inputs of OTs in a larger construction.We also report on an implementation of this approach, that shows that our protocol is more efficient than any previous one: For big enough circuits, we can evaluate more than 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption (gates) takes 64 seconds, but when repeating the task 27 times it only takes less than 3 seconds per instance.