Broadcast-Optimal Four-Round MPC in the Plain Model

Michele Ciampi; Ivan Damgård; Divya Ravi; Luisa Siniscalchi; Yu Xia; Sophia Yakoubov

doi:10.1007/978-3-031-48618-0_1

Broadcast-Optimal Four-Round MPC in the Plain Model

Michele Ciampi, Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Yu Xia^*, Sophia Yakoubov

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Abstract

The prior works of Cohen, Garay and Zikas (Eurocrypt 2020), Damgård, Magri, Ravi, Siniscalchi and Yakoubov (Crypto 2021) and Damgård, Ravi, Siniscalchi and Yakoubov (Eurocrypt 2023) study 2-round Multi-Party Computation (where some form of set-up is required). Motivated by the fact that broadcast is an expensive resource, they focus on so-called broadcast optimal MPC, i.e., they give tight characterizations of which security guarantees are achievable, if broadcast is available in the first round, the second round, both rounds, or not at all. This work considers the natural question of characterizing broadcast optimal MPC in the plain model where no set-up is assumed. We focus on 4-round protocols, since 4 is known to be the minimal number of rounds required to securely realize any functionality with black-box simulation. We give a complete characterization of which security guarantees, (namely selective abort, selective identifiable abort, unanimous abort and identifiable abort) are feasible or not, depending on the exact selection of rounds in which broadcast is available.

Original language	English
Title of host publication	Theory of Cryptography : 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II
Editors	Guy Rothblum, Hoeteck Wee
Number of pages	30
Publisher	Springer
Publication date	Nov 2023
Pages	3-32
ISBN (Print)	978-3-031-48617-3
ISBN (Electronic)	978-3-031-48618-0
DOIs	https://doi.org/10.1007/978-3-031-48618-0_1
Publication status	Published - Nov 2023
Event	21st International conference on Theory of Cryptography Conference, TCC 2023 - Taipei, Taiwan Duration: 29 Nov 2023 → 2 Dec 2023

Conference

Conference	21st International conference on Theory of Cryptography Conference, TCC 2023
Country/Territory	Taiwan
City	Taipei
Period	29/11/2023 → 02/12/2023

Series	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14370
ISSN	0302-9743

Access to Document

10.1007/978-3-031-48618-0_1

Cite this

Ciampi, M., Damgård, I., Ravi, D., Siniscalchi, L., Xia, Y., & Yakoubov, S. (2023). Broadcast-Optimal Four-Round MPC in the Plain Model. In G. Rothblum, & H. Wee (Eds.), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II (pp. 3-32). Springer. https://doi.org/10.1007/978-3-031-48618-0_1

Ciampi, Michele ; Damgård, Ivan ; Ravi, Divya et al. / Broadcast-Optimal Four-Round MPC in the Plain Model. Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II. editor / Guy Rothblum ; Hoeteck Wee. Springer, 2023. pp. 3-32 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 14370 ).

@inproceedings{c8adc7ce425d4ce287fd37a88100385e,

title = "Broadcast-Optimal Four-Round MPC in the Plain Model",

abstract = "The prior works of Cohen, Garay and Zikas (Eurocrypt 2020), Damg{\aa}rd, Magri, Ravi, Siniscalchi and Yakoubov (Crypto 2021) and Damg{\aa}rd, Ravi, Siniscalchi and Yakoubov (Eurocrypt 2023) study 2-round Multi-Party Computation (where some form of set-up is required). Motivated by the fact that broadcast is an expensive resource, they focus on so-called broadcast optimal MPC, i.e., they give tight characterizations of which security guarantees are achievable, if broadcast is available in the first round, the second round, both rounds, or not at all. This work considers the natural question of characterizing broadcast optimal MPC in the plain model where no set-up is assumed. We focus on 4-round protocols, since 4 is known to be the minimal number of rounds required to securely realize any functionality with black-box simulation. We give a complete characterization of which security guarantees, (namely selective abort, selective identifiable abort, unanimous abort and identifiable abort) are feasible or not, depending on the exact selection of rounds in which broadcast is available.",

author = "Michele Ciampi and Ivan Damg{\aa}rd and Divya Ravi and Luisa Siniscalchi and Yu Xia and Sophia Yakoubov",

note = "Publisher Copyright: {\textcopyright} 2023, International Association for Cryptologic Research.; 21st International conference on Theory of Cryptography Conference, TCC 2023 ; Conference date: 29-11-2023 Through 02-12-2023",

year = "2023",

month = nov,

doi = "10.1007/978-3-031-48618-0_1",

language = "English",

isbn = "978-3-031-48617-3",

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

publisher = "Springer",

pages = "3--32",

editor = "Guy Rothblum and Hoeteck Wee",

booktitle = "Theory of Cryptography",

address = "Netherlands",

}

Ciampi, M, Damgård, I, Ravi, D, Siniscalchi, L, Xia, Y & Yakoubov, S 2023, Broadcast-Optimal Four-Round MPC in the Plain Model. in G Rothblum & H Wee (eds), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II. Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14370 , pp. 3-32, 21st International conference on Theory of Cryptography Conference, TCC 2023, Taipei, Taiwan, 29/11/2023. https://doi.org/10.1007/978-3-031-48618-0_1

Broadcast-Optimal Four-Round MPC in the Plain Model. / Ciampi, Michele; Damgård, Ivan; Ravi, Divya et al.
Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II. ed. / Guy Rothblum; Hoeteck Wee. Springer, 2023. p. 3-32 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 14370 ).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Broadcast-Optimal Four-Round MPC in the Plain Model

AU - Ciampi, Michele

AU - Damgård, Ivan

AU - Ravi, Divya

AU - Siniscalchi, Luisa

AU - Xia, Yu

AU - Yakoubov, Sophia

PY - 2023/11

Y1 - 2023/11

N2 - The prior works of Cohen, Garay and Zikas (Eurocrypt 2020), Damgård, Magri, Ravi, Siniscalchi and Yakoubov (Crypto 2021) and Damgård, Ravi, Siniscalchi and Yakoubov (Eurocrypt 2023) study 2-round Multi-Party Computation (where some form of set-up is required). Motivated by the fact that broadcast is an expensive resource, they focus on so-called broadcast optimal MPC, i.e., they give tight characterizations of which security guarantees are achievable, if broadcast is available in the first round, the second round, both rounds, or not at all. This work considers the natural question of characterizing broadcast optimal MPC in the plain model where no set-up is assumed. We focus on 4-round protocols, since 4 is known to be the minimal number of rounds required to securely realize any functionality with black-box simulation. We give a complete characterization of which security guarantees, (namely selective abort, selective identifiable abort, unanimous abort and identifiable abort) are feasible or not, depending on the exact selection of rounds in which broadcast is available.

AB - The prior works of Cohen, Garay and Zikas (Eurocrypt 2020), Damgård, Magri, Ravi, Siniscalchi and Yakoubov (Crypto 2021) and Damgård, Ravi, Siniscalchi and Yakoubov (Eurocrypt 2023) study 2-round Multi-Party Computation (where some form of set-up is required). Motivated by the fact that broadcast is an expensive resource, they focus on so-called broadcast optimal MPC, i.e., they give tight characterizations of which security guarantees are achievable, if broadcast is available in the first round, the second round, both rounds, or not at all. This work considers the natural question of characterizing broadcast optimal MPC in the plain model where no set-up is assumed. We focus on 4-round protocols, since 4 is known to be the minimal number of rounds required to securely realize any functionality with black-box simulation. We give a complete characterization of which security guarantees, (namely selective abort, selective identifiable abort, unanimous abort and identifiable abort) are feasible or not, depending on the exact selection of rounds in which broadcast is available.

U2 - 10.1007/978-3-031-48618-0_1

DO - 10.1007/978-3-031-48618-0_1

M3 - Article in proceedings

AN - SCOPUS:85178646974

SN - 978-3-031-48617-3

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

SP - 3

EP - 32

BT - Theory of Cryptography

A2 - Rothblum, Guy

A2 - Wee, Hoeteck

PB - Springer

T2 - 21st International conference on Theory of Cryptography Conference, TCC 2023

Y2 - 29 November 2023 through 2 December 2023

ER -

Ciampi M, Damgård I, Ravi D, Siniscalchi L, Xia Y, Yakoubov S. Broadcast-Optimal Four-Round MPC in the Plain Model. In Rothblum G, Wee H, editors, Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 – December 2, 2023, Proceedings, Part II. Springer. 2023. p. 3-32. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 14370 ). doi: 10.1007/978-3-031-48618-0_1

Broadcast-Optimal Four-Round MPC in the Plain Model

Abstract

Conference

Access to Document

Fingerprint

Cite this