Paper 2021/1579
Le Mans: Dynamic and Fluid MPC for Dishonest Majority
Abstract
Most MPC protocols require the set of parties to be active for the entire duration of the computation.
Deploying MPC for use cases such as complex and resource-intensive scientific computations increases the barrier of entry for potential participants.
The model of Fluid MPC (Crypto 2021) tackles this issue by giving parties the flexibility to participate in the protocol only when their resources are free.
As such, the set of parties is dynamically changing over time.
In this work, we extend Fluid MPC, which only considered an honest majority, to the setting where the majority of participants at any point in the computation may be corrupt.
We do this by presenting variants of the SPDZ protocol, which support dynamic participants.
Firstly, we describe a universal preprocessing for SPDZ, which allows a set of
Note: Fixed typos and minor clarifications.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in CRYPTO 2022
- Keywords
- multiparty computation dynamic participants dishonest majority
- Contact author(s)
-
rachuri @ cs au dk
peter scholl @ cs au dk - History
- 2022-09-19: last of 2 revisions
- 2021-12-03: received
- See all versions
- Short URL
- https://ia.cr/2021/1579
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1579, author = {Rahul Rachuri and Peter Scholl}, title = {Le Mans: Dynamic and Fluid {MPC} for Dishonest Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/1579}, year = {2021}, url = {https://eprint.iacr.org/2021/1579} }