Our notion is fully compatible with the UC framework, i.e., protocols proven secure in the UC framework remain secure in our framework. Furthermore, our notion lies strictly between SPS and Angel-based security, while being closed under protocol composition.
Shielding away super-polynomial resources allows us to apply new proof techniques where we can replace super-polynomial entities by indistinguishable polynomially bounded entities. This allows us to construct secure protocols in the plain model using weaker primitives than in previous composable frameworks involving simulators with super-poly resources. In particular, we only use non-adaptive-CCA-secure commitments as a building block in our constructions. As a feasibility result, we present a constant-round general MPC protocol in the plain model based on standard assumptions that is secure in our framework.Category / Keywords: foundations / universal composability, protocol design, cryptographic security proofs Date: received 4 Nov 2016, last revised 7 Nov 2016 Contact author: matthias nagel at kit edu Available format(s): PDF | BibTeX Citation Note: Fixed typos and minor changes in wording to clarify some details. In the previous version the parallel, non-adaptive CCA oracle was called by different names and is now called non-adaptive CCA oracle (hopefully) everywhere to avoid confusion of the reader. Version: 20161107:082834 (All versions of this report) Short URL: ia.cr/2016/1043 Discussion forum: Show discussion | Start new discussion