Cryptology ePrint Archive: Report 2020/216

Black-Box Constructions of Bounded-Concurrent Secure Computation

Sanjam Garg and Xiao Liang and Omkant Pandey and Ivan Visconti

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.

Category / Keywords: cryptographic protocols / Multi-Party Computation, Bounded Concurrent Composition, Black-Box Construction, Straight-Line Extraction

Original Publication (with major differences): The Twelfth Conference on Security and Cryptography for Networks (SCN 2020)

Date: received 19 Feb 2020, last revised 30 Jun 2020

Contact author: sanjamg at berkeley edu,liang1@cs stonybrook edu,omkant@cs stonybrook edu,visconti@unisa it

Available format(s): PDF | BibTeX Citation

Note: The full version of the original publication.

Version: 20200630:162737 (All versions of this report)

Short URL: ia.cr/2020/216


[ Cryptology ePrint archive ]