Paper 2023/839
On Linear Communication Complexity for (Maximally) Fluid MPC
Abstract
Secure multiparty computation protocols with dynamic parties, which assume that honest parties do not need to be online throughout the whole execution of the protocol, have recently gained a lot of traction for computations of large scale distributed protocols, such as blockchains. More specifically, in Fluid MPC, introduced in (Choudhuri et al. CRYPTO 2021), parties can dynamically join and leave the computation from round to round. The best known Fluid MPC protocol in the honest majority setting communicates
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in CRYPTO 2023
- Keywords
- MPCFluid MPCHonest MajorityDishonest MajorityLower Bound
- Contact author(s)
-
abienstock @ cs nyu edu
daniel escudero @ protonmail com
antigonipoly @ gmail com - History
- 2023-06-06: approved
- 2023-06-05: received
- See all versions
- Short URL
- https://ia.cr/2023/839
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/839, author = {Alexander Bienstock and Daniel Escudero and Antigoni Polychroniadou}, title = {On Linear Communication Complexity for (Maximally) Fluid {MPC}}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/839}, year = {2023}, url = {https://eprint.iacr.org/2023/839} }