On the message complexity of secure multiparty computation

Yuval Ishai, Manika Mittal, Rafail Ostrovsky

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

Abstract

We study the minimal number of point-to-point messages required for general secure multiparty computation (MPC) in the setting of computational security against semi-honest, static adversaries who may corrupt an arbitrary number of parties. We show that for functionalities that take inputs from n parties and deliver outputs to k parties, 2n+k-3 messages are necessary and sufficient. The negative result holds even when given access to an arbitrary correlated randomness setup. The positive result can be based on any 2-round MPC protocol (which can in turn can be based on 2-message oblivious transfer), or on a one-way function given a correlated randomness setup.

Original languageEnglish
Title of host publicationPublic-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
EditorsMichel Abdalla, Ricardo Dahab
PublisherSpringer Science and Business Media Deutschland GmbH
Pages698-711
Number of pages14
ISBN (Print)9783319765778
DOIs
StatePublished - 2018
Event21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018 - Rio de Janeiro, Brazil
Duration: 25 Mar 201829 Mar 2018

Publication series

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

Conference

Conference21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018
Country/TerritoryBrazil
CityRio de Janeiro
Period25/03/1829/03/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the message complexity of secure multiparty computation'. Together they form a unique fingerprint.

Cite this