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: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.One-sided UC secure computation. Designing adaptive UC 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.

中文翻译：

---

CRS模型中通用可组合安全的黑盒复杂性

在这项工作中，我们基于一般假设研究了黑盒通用可组合 (UC) 安全计算的内在复杂性。我们对各种腐败模型进行了深入研究，同时专注于在公共参考字符串 (CRS) 模型中实现安全性。我们的结果包括：静态UC安全计算。设计第一个基于公钥加密和独立半诚实不经意传输的静态UC不经意传输协议。作为推论，我们获得了第一个 UC 安全计算的黑盒结构，假设只有两轮半诚实不经意转移。单边 UC 安全计算。设计具有单一损坏的自适应 UC 两方计算，假设公钥加密与不经意的密文生成。自适应 UC 安全计算。设计自适应安全 UC 承诺方案，假设只有公钥加密和不经意的密文生成。作为推论，我们获得了自适应 UC 安全计算的第一个黑盒结构，假设仅（陷门）可模拟公钥加密（以及各种具体假设）。我们注意到，即使在非- 黑盒结构。