Black-box constructions of composable protocols without set-up

Huijia Lin, Rafael Pass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology, CRYPTO 2012 - 32nd Annual Cryptology Conference, Proceedings
Pages461-478
Number of pages18
DOIs
StatePublished - 2012
Externally publishedYes
Event32nd Annual International Cryptology Conference, CRYPTO 2012 - Santa Barbara, CA, United States
Duration: 19 Aug 201223 Aug 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7417 LNCS

Conference

Conference32nd Annual International Cryptology Conference, CRYPTO 2012
Country/TerritoryUnited States
CitySanta Barbara, CA
Period19/08/1223/08/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Black-box constructions of composable protocols without set-up'. Together they form a unique fingerprint.

Cite this