Paper 2022/667 Original: eprint.iacr.org/2022/667 ↗
Arithmetic Tuples for MPC
Abstract
Some of the most efficient protocols for Multi-Party Computation (MPC) use a two-phase approach where correlated randomness, in particular Beaver triples, is generated in the offline phase and then used to speed up the online phase. Recently, more complex correlations have been introduced to optimize certain operations even further, such as matrix triples for matrix multiplications. In this paper, our goal is to speed up the evaluation of multivariate polynomials and therewith of whole arithmetic circuits in the online phase. To this end, we introduce a new form of correlated randomness: arithmetic tuples. Arithmetic tuples can be fine tuned in various ways to the constraints of application at hand, in terms of round complexity, bandwidth, and tuple size. We show that for many real-world setups an arithmetic tuples based online phase outperforms state-of-the-art protocols based on Beaver triples.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2024-09-14: last updated
- 2022-05-28: published
- Short URL
- https://ia.cr/2022/667
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/667,
author = {Pascal Reisert and Marc Rivinius and Toomas Krips and Ralf Küsters},
title = {Arithmetic Tuples for MPC},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/667},
year = {2022},
url = {https://eprint.iacr.org/2022/667}
}