A Pragmatic Comparison of Cryptographic Computation Technologies for Machine Learning
Marcus Taubert, Adam Skuta, Thomas Loruenser

TL;DR
This paper compares cryptographic methods SMPC and FHE for secure machine learning, analyzing their theoretical foundations, software implementations, and benchmarking performance across different models and hardware.
Contribution
It provides a comprehensive comparison of SMPC and FHE, including theoretical insights, software benchmarks, and practical guidance for selecting secure computation methods in machine learning.
Findings
FHE outperforms SMPC for regression tasks.
SMPC is more efficient for complex models like CNNs.
FHE may be faster for simple dense networks with GPUs or hybrid models.
Abstract
As security demands increase, the importance of secure computation technologies grows, yet these technologies can often seem overwhelming to practitioners. Furthermore, many approaches focus only on a single technology, potentially overlooking superior alternatives. This work aims to address the issue of selecting the right technology for secure computation by presenting a comparative analysis of two highly relevant cryptographic methods and their software implementations, with a particular focus on machine learning. Firstly, we provide a theoretical summary and comparison of the secure computation paradigms of secure multi-party computation (SMPC) and fully homomorphic encryption (FHE). We outline the advantages and limitations of the protocols, as well as the relevant open-source software implementations. Secondly, we present the results of extensive benchmarking of the main software…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
