论文标题
恒定线性线性广播安全计算
Constant-Round Linear-Broadcast Secure Computation with Penalties
论文作者
论文摘要
众所周知，比特币通过对对抗各方施加货币罚款来实现安全计算中的公平性。此功能称为罚款的安全计算。 Bentov和Kumaresan（Crypto 2014）介绍了可以通过比特币实现的索赔或退款功能。他们以$ o（n）$ rounds和$ o（n）$广播的任何功能的罚款实现了安全计算，其中$ n $是当事人的数量。之后，Kumaresan和Bentov（CCS 2014）显示了一个恒定的协议。不幸的是，此协议需要$ O（n^2）$广播。据我们所知，没有任何协议可以实现$ O（1）$ rounds和$ o（n）$基于比特币的广播。这项工作实现了通过处罚的安全计算效率。我们首先在稍微放松的设置中显示一个协议，称为安全计算，并以非等效的惩罚。此设置与罚款的安全计算相同，除了每个诚实的一方都收到的薪酬数量超过预定量，而前一方要求每个诚实的一方获得相同数量的薪酬。也就是说，我们的设置允许对诚实政党的赔偿是不等式的。此外，我们提出了一种在不牺牲效率的情况下消除协议的非等效性的技术。然后，我们提出了一种称为Sopled-Reffrud-or-Give的新的理想功能，可以通过比特币实现。
It is known that Bitcoin enables achieving fairness in secure computation by imposing monetary penalties on adversarial parties. This functionality is called secure computation with penalties. Bentov and Kumaresan (Crypto 2014) introduced the claim-or-refund functionality that can be implemented via Bitcoin. They achieved secure computation with penalties with $O(n)$ rounds and $O(n)$ broadcasts for any function, where $n$ is the number of parties. After that, Kumaresan and Bentov (CCS 2014) showed a constant-round protocol. Unfortunately, this protocol requires $O(n^2)$ broadcasts. As far as we know, no protocol achieves $O(1)$ rounds and $O(n)$ broadcasts based on Bitcoin. This work accomplishes such efficiency in secure computation with penalties. We first show a protocol in a slightly relaxed setting called secure computation with non-equivalent penalties. This setting is the same as secure computation with penalties except that every honest party receives more than a predetermined amount of compensation, while the previous one requires that every honest party receives the same amount of compensation. Namely, our setting allows the compensations for honest parties to be non-equivalent. Moreover, we present a technique to remove the non-equivalence of our protocol without sacrificing efficiency. We then propose a new ideal functionality called claim-refund-or-give that can be implemented via Bitcoin.
