Cryptology ePrint Archive: Report 2015/488

On Black-Box Complexity of Universally Composable Security in the CRS model

Carmit Hazay and Muthuramakrishnan Venkitasubramaniam

Abstract: In this work, we study the intrinsic complexity of black-box 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: 1. 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. 2. One-sided UC secure computation. Designing adaptive UC secure two-party computation with single corruptions assuming public-key encryption with oblivious ciphertext generation. 3. 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.

Category / Keywords: foundations / universal composability, black-box, adaptive security

Date: received 21 May 2015

Contact author: muthuv at cs rochester edu

Available format(s): PDF | BibTeX Citation

Version: 20150522:064537 (All versions of this report)

Short URL: ia.cr/2015/488

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]