Paper 2024/386
High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings
Abstract
In this work, we present novel protocols over rings for semi-honest secure three-party computation (3PC) and malicious four-party computation (4PC) with one corruption. While most existing works focus on improving total communication complexity, challenges such as network heterogeneity and computational complexity, which impact MPC performance in practice, remain underexplored. Our protocols address these issues by tolerating multiple arbitrarily weak network links between parties without any substantial decrease in performance. Additionally, they significantly reduce computational complexity by requiring up to half the number of basic instructions per gate compared to related work. These improvements lead to up to twice the throughput of state-of-the-art protocols in homogeneous network settings and up to eight times higher throughput in real-world heterogeneous settings. These advantages come at no additional cost: Our protocols maintain the best-known total communication complexity per multiplication, requiring 3 elements for 3PC and 5 elements for 4PC. We implemented our protocols alongside several state-of-the-art protocols (Replicated 3PC, ASTRA, Fantastic Four, Tetrad) in a novel open-source C++ framework optimized for high throughput. Five out of six implemented 3PC and 4PC protocols achieve more than one billion 32-bit multiplications or over 32 billion AND gates per second using our implementation in a 25 Gbit/s LAN environment. This represents the highest throughput achieved in 3PC and 4PC so far, outperforming existing frameworks like MP-SPDZ, ABY3, MPyC, and MOTION by two to three orders of magnitude.
Note: This is the public version of the paper to be published at the 25th Privacy Enhancing Technologies Symposium (PETS 2025).
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- MPC ProtocolsHonest Majority3PC4PCImplementation
- Contact author(s)
-
christopher harth-kitzerow @ tum de
ajith suresh @ tii ae
yongqin @ usc edu
hossein yalame @ de bosch com
carle @ net in tum de
annavara @ usc edu - History
- 2024-08-30: last of 3 revisions
- 2024-03-01: received
- See all versions
- Short URL
- https://ia.cr/2024/386
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/386, author = {Christopher Harth-Kitzerow and Ajith Suresh and Yongqin Wang and Hossein Yalame and Georg Carle and Murali Annavaram}, title = {High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/386}, year = {2024}, url = {https://eprint.iacr.org/2024/386} }