Paper 2024/1990 Original: eprint.iacr.org/2024/1990 ↗
How To Scale Multi-Party Computation
Abstract
We propose a solution for optimized scaling of multi-party computation using the MP-SPDZ framework (CCS’20). It does not use manual optimization but extends the compiler and the virtual machine of the framework, thus providing an improvement for any user. We found that our solution improves timings four-fold for a simple example in MP-SPDZ, and it improves an order of magnitude on every framework using secret sharing considered by Hastings et al. (S&P’19) either in terms of time or RAM usage. The core of our approach is finding a balance between communication round optimization and memory usage.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-07-17: last updated
- 2024-12-09: published
- Short URL
- https://ia.cr/2024/1990
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1990,
author = {Marcel Keller},
title = {How To Scale Multi-Party Computation},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1990},
year = {2024},
url = {https://eprint.iacr.org/2024/1990}
}