Abstract: All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumptions. In this paper we provide the first general construction of secure multi-party computation protocol without any setup that guarantees composable security in the presence of an adaptive adversary based on standard polynomial-time assumptions. We prove security under the notion of “UC with super-polynomial helpers” introduced by Canetti Lin and Pass (FOCS 2010), which is closed under universal composition and implies “superpolynomial-time simulation”. Moreover, our construction relies on the underlying cryptographic primitives in a black-box manner.
Joint work with Carmit Hazay.