Paper 2023/1187
Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels
Abstract
In this paper we continue the study of two-round broadcast-optimal MPC, where broadcast is used in one of the two rounds, but not in both. We consider the realistic scenario where the round that does not use broadcast is asynchronous. Since a first asynchronous round (even when followed by a round of broadcast) does not admit any secure computation, we introduce a new notion of asynchrony which we call
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. LATINCRYPT 2023
- Keywords
- Secure ComputationRound ComplexityAsynchrony
- Contact author(s)
-
ivan @ cs au dk
divya 18oct @ gmail com
luisi @ dtu dk
sophia yakoubov @ cs au dk - History
- 2023-08-04: approved
- 2023-08-03: received
- See all versions
- Short URL
- https://ia.cr/2023/1187
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1187, author = {Ivan Damgård and Divya Ravi and Luisa Siniscalchi and Sophia Yakoubov}, title = {Broadcast-Optimal Two Round {MPC} with Asynchronous Peer-to-Peer Channels}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1187}, year = {2023}, url = {https://eprint.iacr.org/2023/1187} }