mlsanityData to 7 Oct 2026

Efficient ML Models for Practical Secure Inference

arXiv 2209.00411 ↗First posted 26 Aug 2022cs.CR cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

ML-as-a-service continues to grow, and so does the need for very strong privacy guarantees. Secure inference has emerged as a potential solution, wherein cryptographic primitives allow inference without revealing users' inputs to a model provider or model's weights to a user. For instance, the model provider could be a diagnostics company that has trained a state-of-the-art DenseNet-121 model for interpreting a chest X-ray and the user could be a patient at a hospital. While secure inference is in principle feasible for this setting, there are no existing techniques that make it practical at scale. The CrypTFlow2 framework provides a potential solution with its ability to automatically and correctly translate clear-text inference to secure inference for arbitrary models. However, the resultant secure inference from CrypTFlow2 is impractically expensive: Almost 3TB of communication is required to interpret a single X-ray on DenseNet-121. In this paper, we address this outstanding challenge of inefficiency of secure inference with three contributions. First, we show that the primary bottlenecks in secure inference are large linear layers which can be optimized with the choice of network backbone and the use of operators developed for efficient clear-text inference. This finding and emphasis deviates from many recent works which focus on optimizing non-linear activation layers when performing secure inference of smaller networks. Second, based on analysis of a bottle-necked convolution layer, we design a X-operator which is a more efficient drop-in replacement. Third, we show that the fast Winograd convolution algorithm further improves efficiency of secure inference. In combination, these three optimizations prove to be highly effective for the problem of X-ray interpretation trained on the CheXpert dataset.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 52 references that are in the map. First posted on arXiv 26 Aug 2022.

Builds on

23 of 52 references.

References · 23

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Densely Connected Convolutional Networkscited by 6,691
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  5. 2019Searching for MobileNetV3cited by 1,984
  6. 2019CheXpert: A Large Chest Radiograph Dataset with Uncertainty Labels and Expert Comparisoncited by 1,410
  7. 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
  8. 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 427
  9. 2018Gazelle: A Low Latency Framework for Secure Neural Network Inferencecited by 193
  10. 2021CrypTen: Secure Multi-Party Computation Meets Machine Learningcited by 131
  11. 2018A generic framework for privacy preserving deep learningcited by 103
  12. 2015Fast Algorithms for Convolutional Neural Networkscited by 102
11 more
  1. 2020CrypTFlow2: Practical 2-Party Secure Inferencecited by 82
  2. 2018SqueezeNext: Hardware-Aware Neural Network Designcited by 61
  3. 2019CrypTFlow: Secure TensorFlow Inferencecited by 61
  4. 2021DeepReDuce: ReLU Reduction for Fast Private Inferencecited by 50
  5. 2020CryptoNAS: Private Inference on a ReLU Budgetcited by 40
  6. 2018nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Datacited by 24
  7. 2019Secure Evaluation of Quantized Neural Networkscited by 22
  8. 2018Private Machine Learning in TensorFlow using Secure Computationcited by 15
  9. 2022Winograd Convolution for Deep Neural Networks: Efficient Point Selectioncited by 8
  10. 2021FuSeConv: Fully Separable Convolutions for Fast Inference on Systolic Arrayscited by 2
  11. 2021Design and Scaffolded Training of an Efficient DNN Operator for Computer Vision on the Edgecited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.

2 papers.