Paper 2022/1453

Assisted MPC

Philipp Muth, TU Darmstadt
Stefan Katzenbeisser, University of Passau

Since their introduction in the 1970s, multi-party computation protocols have become the prevalent method for two or more parties to jointly compute an agreed upon function on private inputs without revealing them to other parties. While some efficiency gains in the offline phase of MPC protocols have been achieved, most works in the past have focused on optimising the online phase. Improvements to the online phase typically shifted significant workload to the offline phase. In this work we explore a novel approach to streamline the offline phase of secret sharing based MPC protocols by introducing a helper party that executes the preprocessing for the parties engaged in the online phase. We prove, that the security guarantees provided by the MPC protocols stay unchanged and demonstrate the efficiency of our approach in two sets of benchmarks. We furthermore give three examples of real world instantiations of the helper party to demonstrate that our approach is not only of a theoretical nature.

Available format(s)
Cryptographic protocols
Publication info
Multi-party computation Secret sharing Preprocessing speed up
Contact author(s)
philipp muth @ tu-darmstadt de
2022-10-25: approved
2022-10-24: received
See all versions
Short URL
Creative Commons Attribution-ShareAlike


      author = {Philipp Muth and Stefan Katzenbeisser},
      title = {Assisted MPC},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1453},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.