Paper 2023/462

Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice

Sebastian Hasler, University of Stuttgart
Toomas Krips, University of Tartu
Ralf Küsters, University of Stuttgart
Pascal Reisert, University of Stuttgart
Marc Rivinius, University of Stuttgart

Some of the most efficient protocols for Multi-Party Computation (MPC) follow 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 improve the efficiency of the triple generation in general and in particular for classical field values as well as matrix operations. To this end, we modify the Overdrive LowGear protocol to remove the costly sacrificing step and therewith reduce the round complexity and the bandwidth. We extend the state-of-the-art MP-SPDZ implementation with our new protocols and show that the new offline phase outperforms state-of-the-art protocols for the generation of Beaver triples and matrix triples. For example, we save 33 % in bandwidth compared to Overdrive LowGear.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. ASIA CCS '23
Multi-party computation
Contact author(s)
pascal reisert @ sec uni-stuttgart de
2023-03-31: approved
2023-03-30: received
See all versions
Short URL
Creative Commons Attribution


      author = {Sebastian Hasler and Toomas Krips and Ralf Küsters and Pascal Reisert and Marc Rivinius},
      title = {Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice},
      howpublished = {Cryptology ePrint Archive, Paper 2023/462},
      year = {2023},
      doi = {10.1145/3579856.3582809},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.