Beyond Latency: A System-Level Characterization of MPC and FHE for PPML
Pengzhi Huang, Kiwan Maeng, G. Edward Suh

TL;DR
This paper provides a comprehensive system-level comparison of MPC and FHE approaches for privacy-preserving machine learning, evaluating performance, energy, and cost across various models and environments.
Contribution
It offers a unified, empirical analysis of multiple PPML methods considering system metrics and hardware trends, aiding in practical deployment decisions.
Findings
Evaluates MPC and FHE on CNN and Transformer models in LAN and WAN environments.
Analyzes energy consumption and monetary costs alongside performance metrics.
Provides guidance for optimizing and deploying PPML techniques in real-world scenarios.
Abstract
Privacy protection has become an increasing concern in modern machine learning applications. Privacy-preserving machine learning (PPML) has attracted growing research attention, with approaches such as secure multiparty computation (MPC) and fully homomorphic encryption (FHE) being actively explored. However, existing evaluations of these approaches have frequently been done on a narrow, fragmented setup and only focused on a specific performance metric, such as the online inference latency of a specific batch size. From the existing reports, it is hard to compare different approaches, especially when considering other metrics like energy/cost or broader system setups (various hyperparameters, offline overheads, future hardware/network configurations, etc.). We present a unified characterization of three popular approaches -- two variants of MPC based on arithmetic/binary sharing…
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.
