Paper 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 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 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A minor revision of an IACR publication in ASIACRYPT 2015
Keywords
UC Secure ComputationBlack-Box ConstructionsOblivious TransferUC Commitments
Contact author(s)
carmit hazay @ biu ac il
History
2019-04-15: revised
2015-05-22: received
See all versions
Short URL
https://ia.cr/2015/488
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/488,
      author = {Carmit Hazay and Muthuramakrishnan Venkitasubramaniam},
      title = {On Black-Box Complexity of Universally Composable Security in the CRS model},
      howpublished = {Cryptology ePrint Archive, Paper 2015/488},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/488}},
      url = {https://eprint.iacr.org/2015/488}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.