Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Back to Paper
cs.CR

Local ID: 2604.00169v2

AI Summary: gemma4:e4b

Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

By Pengzhi Huang, Kiwan Maeng, G. Edward Suh

Revision History Timeline

v13/31/2026
3/31/2026

“ISPASS 2026 Accepted”

v24/21/2026
4/21/2026

“This version includes minor corrections to the ISPASS 2026 accepted paper”

★ Version indexed in Explorer

Comparing v1 vs v2

Green = Added • Red = Removed

Title Comparison

Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

Authors Comparison

No author changes.

v1 Comment

“ISPASS 2026 Accepted”

v2 Comment

“This version includes minor corrections to the ISPASS 2026 accepted paper”

Abstract Word Diff

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 conversion and function secret sharing, and FHE -- on their performance and cost in performing privacy-preserving inference on multiple CNN and Transformer models. We study a range of LAN and WAN environments, model sizes, batch sizes, and input sequence lengths. We evaluate not only the performance but also the energy consumption and monetary cost of deploying under a realistic scenario, taking into account their offline and online computation/communication overheads. We provide empirical guidance for selecting, optimizing, and deploying these privacy-preserving compute paradigms, and outline how evolving hardware and network trends are likely to shift trade-offs between the two MPC schemes and FHE. This work provides system-level insights for researchers and practitioners who seek to understand or accelerate PPML workloads.
View Full Version History on arXiv