Paper 2014/557
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
Susumu Kiyoshima
Abstract
We present a round-efficient black-box construction of a general MPC protocol that satisfies composability in the plain model. The security of our protocol is proven in angel-based UC framework under the minimal assumption of the existence of semi-honest oblivious transfer protocols. When the round complexity of the underlying oblivious transfer protocol is Round(OT), the round complexity of our protocol is max(\tilde{O}(log^2 n), O(Round(OT))). 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 \tilde{O}(log^2 n)-round protocol under these assumptions. Previously, only an O(max(n^{\epsilon}, Round(OT))-round protocol was shown, where \epsilon>0 is an arbitrary constant. We obtain our MPC protocol by constructing a \tilde{O}(log^2 n)-round CCA-secure commitment scheme in a black-box way under the assumption of the existence of one-way functions.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in CRYPTO 2014
- Keywords
- composable securityCCA-secure commitment scheme
- Contact author(s)
- kiyoshima susumu @ lab ntt co jp
- History
- 2018-08-21: revised
- 2014-07-18: received
- See all versions
- Short URL
- https://ia.cr/2014/557
- License
-
CC BY