@inproceedings{77464fc97f5742bcaf8735f0c6a47ddc,
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)",
publisher = "Springer Science and Business Media Deutschland GmbH",
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",
address = "ألمانيا",
}