Skip to main navigation Skip to search Skip to main content

Black-box constructions of bounded-concurrent secure computation

  • University of California at Berkeley
  • Stony Brook University
  • University of Salerno

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

Abstract

We construct a general purpose secure multiparty computation protocol which remains secure under (a-priori) bounded-concurrent composition and makes only black-box use of cryptographic primitives. Prior to our work, constructions of such protocols required non-black-box usage of cryptographic primitives; alternatively, black-box constructions could only be achieved for super-polynomial simulation based notions of security which offer incomparable security guarantees. Our protocol has a constant number of rounds and relies on standard polynomial-hardness assumptions, namely, the existence of semi-honest oblivious transfers and collision-resistant hash functions. Previously, such protocols were not known even under sub-exponential assumptions.

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 12th International Conference, SCN 2020, Proceedings
EditorsClemente Galdi, Vladimir Kolesnikov
PublisherSpringer Science and Business Media Deutschland GmbH
Pages87-107
Number of pages21
ISBN (Print)9783030579890
DOIs
StatePublished - 2020
Event12th International Conference on Security and Cryptography for Networks, SCN 2020 - Amalfi, Italy
Duration: Sep 14 2020Sep 16 2020

Publication series

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

Conference

Conference12th International Conference on Security and Cryptography for Networks, SCN 2020
Country/TerritoryItaly
CityAmalfi
Period09/14/2009/16/20

Keywords

  • Black-box construction
  • Bounded concurrent composition
  • Multi-party computation
  • Straight-line extraction

Fingerprint

Dive into the research topics of 'Black-box constructions of bounded-concurrent secure computation'. Together they form a unique fingerprint.

Cite this