Round-Efficient Black-Box Construction of Composable Multi-Party Computation
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
复制标题
DOI：
10.1007/s00145-018-9276-1
复制
发表时间：
2014-08
影响因子：
3
通讯作者：
Susumu Kiyoshima
中科院分区：
文献类型：
--
作者：
Susumu Kiyoshima
我们提出了一个轮效率的黑箱构造的一般多方计算（MPC）协议，满足在平原模型的可组合性。在基于天使的UC框架[Prabhakaran和Sahai，STOC'04]中，在存在半诚实不经意传输协议的最小假设下证明了我们协议的安全性。当底层不经意传输协议的轮复杂度为时，我们的协议的轮复杂度为。由于常数轮半诚实不经意传输协议可以在标准假设下构造（如存在增强陷门置换），我们的结果给出了在这些假设下的a轮协议。以前，只显示了一个圆形协议，其中是一个任意常数。在单向函数存在的假设下，我们通过黑箱的方法构造了一轮CCA安全承诺方案，得到了MPC协议。
We present a round-efficient black-box construction of a general multi-party computation (MPC) protocol that satisfies composability in the plain model. The security of our protocol is proven in the angel-based UC framework [Prabhakaran and Sahai, STOC’04] under the minimal assumption of the existence of semi-honest oblivious transfer protocols. The round complexity of our protocol iswhen the round complexity of the underlying oblivious transfer protocol is. Since constant-round semi-honest oblivious transfer protocols can be constructed under standard assumptions (such as the existence of enhanced trapdoor permutations), our result gives a-round protocol under these assumptions. Previously, only an-round protocol was shown, whereis an arbitrary constant. We obtain our MPC protocol by constructing a-round CCA-secure commitment scheme in a black-box way under the assumption of the existence of one-way functions.