On the message complexity of secure multiparty computation

Yuval Ishai; Manika Mittal; Rafail Ostrovsky

doi:10.1007/978-3-319-76578-5_24

On the message complexity of secure multiparty computation

Yuval Ishai, Manika Mittal, Rafail Ostrovsky

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

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 language	English
Title of host publication	Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
Editors	Michel Abdalla, Ricardo Dahab
Pages	698-711
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-319-76578-5_24
State	Published - 2018
Event	21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018 - Rio de Janeiro, Brazil Duration: 25 Mar 2018 → 29 Mar 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10769 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018
Country/Territory	Brazil
City	Rio de Janeiro
Period	25/03/18 → 29/03/18

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-76578-5_24

Cite this

Ishai, Y., Mittal, M., & Ostrovsky, R. (2018). On the message complexity of secure multiparty computation. In M. Abdalla, & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (pp. 698-711). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10769 LNCS). https://doi.org/10.1007/978-3-319-76578-5_24

Ishai, Yuval ; Mittal, Manika ; Ostrovsky, Rafail. / On the message complexity of secure multiparty computation. Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. editor / Michel Abdalla ; Ricardo Dahab. 2018. pp. 698-711 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{debe4fb2a85e45b099885ea72199b1d1,

title = "On the message complexity of secure multiparty computation",

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.",

author = "Yuval Ishai and Manika Mittal and Rafail Ostrovsky",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2018.; 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018 ; Conference date: 25-03-2018 Through 29-03-2018",

year = "2018",

doi = "10.1007/978-3-319-76578-5_24",

language = "אנגלית",

isbn = "9783319765778",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "698--711",

editor = "Michel Abdalla and Ricardo Dahab",

booktitle = "Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings",

}

Ishai, Y, Mittal, M & Ostrovsky, R 2018, On the message complexity of secure multiparty computation. in M Abdalla & R Dahab (eds), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10769 LNCS, pp. 698-711, 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018, Rio de Janeiro, Brazil, 25/03/18. https://doi.org/10.1007/978-3-319-76578-5_24

On the message complexity of secure multiparty computation. / Ishai, Yuval; Mittal, Manika; Ostrovsky, Rafail.
Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. ed. / Michel Abdalla; Ricardo Dahab. 2018. p. 698-711 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10769 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the message complexity of secure multiparty computation

AU - Ishai, Yuval

AU - Mittal, Manika

AU - Ostrovsky, Rafail

N1 - Publisher Copyright: © International Association for Cryptologic Research 2018.

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85057129736&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-76578-5_24

DO - 10.1007/978-3-319-76578-5_24

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85057129736

SN - 9783319765778

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 698

EP - 711

BT - Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings

A2 - Abdalla, Michel

A2 - Dahab, Ricardo

T2 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018

Y2 - 25 March 2018 through 29 March 2018

ER -

Ishai Y, Mittal M, Ostrovsky R. On the message complexity of secure multiparty computation. In Abdalla M, Dahab R, editors, Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings. 2018. p. 698-711. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-76578-5_24

On the message complexity of secure multiparty computation

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this