### 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.

Available format(s)
Category
Foundations
Publication info
Preprint.
Keywords
Secure multiparty computation Mathematical aspects of cryptography
Contact author(s)
pascal reisert @ sec uni-stuttgart de
History
2022-05-31: last of 2 revisions
See all versions
Short URL
https://ia.cr/2022/667

CC BY

BibTeX

@misc{cryptoeprint:2022/667,
author = {Pascal Reisert and Marc Rivinius and Toomas Krips and Ralf Kuesters},
title = {Arithmetic Tuples for MPC},
howpublished = {Cryptology ePrint Archive, Paper 2022/667},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/667}},
url = {https://eprint.iacr.org/2022/667}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.