Black-box constructions of composable protocols without set-up

Abstract

We present the first black-box construction of a secure multi-party computation protocol that satisfies a meaningful notion of concurrent security in the plain model (without any set-up, and without assuming an honest majority). Moreover, our protocol relies on the minimal assumption of the existence of a semi-honest OT protocol, and our security notion "UC with super-polynomial helpers" (Canetti et al, STOC'10) is closed under universal composition, and implies super-polynomial-time simulation security. © 2012 International Association for Cryptologic Research.