In this work, we study the intrinsic complexity of blackbox Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: – Static UC Secure Computation. Designing the first static UC secure oblivious transfer protocol based on public-key encryption and stand-alone semi-honest oblivious transfer. As a corollary we obtain the first black-box constructions of UC secure computation assuming only two-round semi-honest oblivious transfer. – One-sided UC Secure Computation. Designing adaptive UC secure two-party computation with single corruptions assuming public-key encryption with oblivious ciphertext generation. – Adaptive UC Secure Computation. Designing adaptively secure UC commitment scheme assuming only public-key encryption with oblivious ciphertext generation. As a corollary we obtain the first black-box constructions of adaptive UC secure computation assuming only (trapdoor) simulatable public-key encryption (as well as a variety of concrete assumptions). We remark that such a result was not known even under non-black-box constructions.
|Title of host publication||Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings|
|Editors||Tetsu Iwata, Jung Hee Cheon|
|Number of pages||27|
|State||Published - 2015|
|Event||21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015 - Auckland, New Zealand|
Duration: 29 Nov 2015 → 3 Dec 2015
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015|
|Period||29/11/15 → 3/12/15|
Bibliographical noteFunding Information:
C. Hazay—Research partially supported by a grant from the Israel Ministry of Science and Technology (grant No. 3-10883). M. Venkitasubramaniam—Research supported by Google Faculty Research Grant and NSF Award CNS-1526377.
© International Association for Cryptologic Research 2015.
- Black-box constructions
- Oblivious transfer
- UC commitments
- UC secure computation