Secure Multiparty Computation with Sublinear Preprocessing

Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


A common technique for enhancing the efficiency of secure multiparty computation (MPC) with dishonest majority is via preprocessing: In an offline phase, parties engage in an input-independent protocol to securely generate correlated randomness. Once inputs are known, the correlated randomness is consumed by a “non-cryptographic” and highly efficient online protocol. The correlated randomness in such protocols traditionally comes in two flavors: multiplication triples (Beaver, Crypto ’91), which suffice for security against semi-honest parties, and authenticated multiplication triples (Bendlin et al., Eurocrypt ’11, Damgård et al., Crypto ’12) that yield efficient protocols against malicious parties. Recent constructions of pseudorandom correlation generators (Boyle et al., Crypto ’19, ’20) enable concretely efficient secure generation of multiplication triples with sublinear communication complexity. However, these techniques do not efficiently apply to authenticated triples, except in the case of secure two-party computation of arithmetic circuits over large fields. In this work, we propose the first concretely efficient approach for (malicious) MPC with preprocessing in which the offline communication is sublinear in the circuit size. More specifically, the offline communication scales with the square root of the circuit size. From a feasibility point of view, our protocols can make use of any secure protocol for generating (unauthenticated) multiplication triples together with any additive homomorphic encryption. We propose concretely efficient instantiations (based on strong but plausible “linear-only” assumptions) from existing homomorphic encryption schemes and pseudorandom correlation generators. Our technique is based on a variant of a recent protocol of Boyle et al. (Crypto ’21) for MPC with preprocessing. As a result, our protocols inherit the succinct correlated randomness feature of the latter protocol.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings
EditorsOrr Dunkelman, Stefan Dziembowski
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages31
ISBN (Print)9783031069437
StatePublished - 2022
Externally publishedYes
Event41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 - Trondheim, Norway
Duration: 30 May 20223 Jun 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13275 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022

Bibliographical note

Publisher Copyright:
© 2022, International Association for Cryptologic Research.


Acknowledgments. We thank the Eurocrypt reviewers for helpful comments. E. Boyle supported by a Google Research Scholar Award, AFOSR Award FA9550-21-1-0046, ERC Project HSS (852952), and ERC Project NTSC (742754). N. Gilboa supported by ISF grant 2951/20, ERC grant 876110, and a grant by the BGU Cyber Center. Y. Ishai supported by ERC Project NTSC (742754), BSF grant 2018393, and ISF grant 2774/20. A. Nof supported by ERC Project NTSC (742754).

FundersFunder number
Air Force Office of Scientific ResearchFA9550-21-1-0046
European Research Council852952
United States-Israel Binational Science Foundation2018393, 2774/20
Israel Science Foundation876110, 2951/20
Ben-Gurion University of the Negev


    Dive into the research topics of 'Secure Multiparty Computation with Sublinear Preprocessing'. Together they form a unique fingerprint.

    Cite this