Black-Box Constructions of Composable Protocols without Set-Up

Conference paper

DOI: 10.1007/978-3-642-32009-5_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7417)
Cite this paper as:
Lin H., Pass R. (2012) Black-Box Constructions of Composable Protocols without Set-Up. In: Safavi-Naini R., Canetti R. (eds) Advances in Cryptology – CRYPTO 2012. Lecture Notes in Computer Science, vol 7417. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2012 2012

Authors and Affiliations

  1. 1.MITCambridgeUSA
  2. 2.Boston UniversityBostonUSA
  3. 3.Cornell UniversityIthacaUSA

Personalised recommendations