Characterizing and Optimizing End-to-End Systems for Private Inference
Not on the map. Why?
Abstract (arXiv)
In two-party machine learning prediction services, the client's goal is to query a remote server's trained machine learning model to perform neural network inference in some application domain. However, sensitive information can be obtained during this process by either the client or the server, leading to potential collection, unauthorized secondary use, and inappropriate access to personal information. These security concerns have given rise to Private Inference (PI), in which both the client's personal data and the server's trained model are kept confidential. State-of-the-art PI protocols consist of a pre-processing or offline phase and an online phase that combine several cryptographic primitives: Homomorphic Encryption (HE), Secret Sharing (SS), Garbled Circuits (GC), and Oblivious Transfer (OT). Despite the need and recent performance improvements, PI remains largely arcane today and is too slow for practical use. This paper addresses PI's shortcomings with a detailed characterization of a standard high-performance protocol to build foundational knowledge and intuition in the systems community. Our characterization pinpoints all sources of inefficiency -- compute, communication, and storage. In contrast to prior work, we consider inference request arrival rates rather than studying individual inferences in isolation and we find that the pre-processing phase cannot be ignored and is often incurred online as there is insufficient downtime to hide pre-compute latency. Finally, we leverage insights from our characterization and propose three optimizations to address the storage (Client-Garbler), computation (layer-parallel HE), and communication (wireless slot allocation) overheads. Compared to the state-of-the-art PI protocol, these optimizations provide a total PI speedup of 1.8× with the ability to sustain inference requests up to a 2.24× greater rate.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Jul 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 1; 2026: 1.
8 papers.
- 2024AdaPI: Facilitating DNN Model Adaptivity for Efficient Private Inference in Edge Computingcited by 15
- 2023Falcon: Accelerating Homomorphically Encrypted Convolutions for Efficient Private Mobile Network Inferencecited by 5
- 2022MPC-Pipe: an Efficient Pipeline Scheme for Secure Multi-party Machine Learning Inferencecited by 4
- 2023Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inferencecited by 2
- 2023Towards Fast and Scalable Private Inferencecited by 1
- 2024FastQuery: Communication-efficient Embedding Table Query for Private LLM Inferencecited by 1
- 2025CrypTorch: PyTorch-based Auto-tuning Compiler for Machine Learning with Multi-party Computationcited by 1
- 2026OptiPrime: Optimizing Private Inference through Protocol-Hardware Co-designcited by 0
- 2026OptiPrime: Optimizing Private Inference through Protocol-Hardware Co-design15 Sep 2026
- 2025CrypTorch: PyTorch-based Auto-tuning Compiler for Machine Learning with Multi-party Computation24 Nov 2025
- 2024AdaPI: Facilitating DNN Model Adaptivity for Efficient Private Inference in Edge Computing8 Jul 2024
- 2024FastQuery: Communication-efficient Embedding Table Query for Private LLM Inference25 May 2024
- 2023Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inference9 Sep 2023
- 2023Falcon: Accelerating Homomorphically Encrypted Convolutions for Efficient Private Mobile Network Inference25 Aug 2023
- 2023Towards Fast and Scalable Private Inference9 Jul 2023
- 2022MPC-Pipe: an Efficient Pipeline Scheme for Secure Multi-party Machine Learning Inference27 Sep 2022