Beyond Latency: A System-Level Characterization of MPC and FHE for PPML
arXiv:2604.00169v1 Announce Type: new 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 config
View PDF HTML (experimental)
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 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.
Comments: ISPASS 2026 Accepted
Subjects:
Cryptography and Security (cs.CR)
Cite as: arXiv:2604.00169 [cs.CR]
(or arXiv:2604.00169v1 [cs.CR] for this version)
https://doi.org/10.48550/arXiv.2604.00169
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Pengzhi Huang [view email] [v1] Tue, 31 Mar 2026 19:18:52 UTC (3,046 KB)
Sign in to highlight and annotate this article

Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
modeltransformerannounce
A robust vision language model for molecular status prediction and radiology report generation in adult-type diffuse gliomas
npj Digital Medicine, Published online: 02 April 2026; doi:10.1038/s41746-026-02581-x A robust vision language model for molecular status prediction and radiology report generation in adult-type diffuse gliomas
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.




Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!