Asynchronous secure multiparty computation in constant time

Ran Cohen

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

15 Scopus citations

Abstract

In the setting of secure multiparty computation, a set of mutually distrusting parties wish to securely compute a joint function. It is well known that if the communication model is asynchronous, meaning that messages can be arbitrarily delayed by an unbounded (yet finite) amount of time, secure computation is feasible if and only if at least twothirds of the parties are honest, as was shown by Ben-Or, Canetti, and Goldreich [STOC’93] and by Ben-Or, Kelmer, and Rabin [PODC’94]. The running-time of all currently known protocols depends on the function to evaluate. In this work we present the first asynchronous MPC protocol that runs in constant time. Our starting point is the asynchronous MPC protocol of Hirt, Nielsen, and Przydatek [Eurocrypt’05, ICALP’08]. We integrate threshold fully homomorphic encryption in order to reduce the interactions between the parties, thus completely removing the need for the expensive king-slaves approach taken by Hirt et al.. Initially, assuming an honest majority, we construct a constant-time protocol in the asynchronous Byzantine agreement (ABA) hybrid model. Using a concurrent ABA protocol that runs in constant expected time, we obtain a constant expected time asynchronous MPC protocol, secure facing static malicious adversaries, assuming t < n/3.

Original languageEnglish
Title of host publicationPublic-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
EditorsChen-Mou Cheng, Kai-Min Chung, Bo-Yin Yang, Giuseppe Persiano
PublisherSpringer Verlag
Pages183-207
Number of pages25
ISBN (Print)9783662493861
DOIs
StatePublished - 2016
Event19th IACR International Conference on Practice and Theory in Public-Key Cryptography, PKC 2016 - Taipei, Taiwan, Province of China
Duration: 6 Mar 20169 Mar 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9615
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th IACR International Conference on Practice and Theory in Public-Key Cryptography, PKC 2016
Country/TerritoryTaiwan, Province of China
CityTaipei
Period6/03/169/03/16

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2016.

Keywords

  • Asynchronous communication
  • Byzantine agreement
  • Constant-time protocols
  • Multiparty computation
  • Threshold FHE

Fingerprint

Dive into the research topics of 'Asynchronous secure multiparty computation in constant time'. Together they form a unique fingerprint.

Cite this