Cheetah: Optimizing and Accelerating Homomorphic Encryption for Private Inference
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
As the application of deep learning continues to grow, so does the amount of data used to make predictions. While traditionally big-data deep learning was constrained by computing performance and off-chip memory bandwidth, a new constraint has emerged: privacy. One solution is homomorphic encryption (HE). Applying HE to the client-cloud model allows cloud services to perform inferences directly on clients’ encrypted data. While HE can meet privacy constraints it introduces enormous computational challenges and remains impractically slow on current systems.This paper introduces Cheetah, a set of algorithmic and hardware optimizations for server-side HE DNN inference. Cheetah proposes HE-parameter tuning and operator scheduling optimizations, which together deliver up to $79 \times$ speedup over the state-of-the-art. However, HE inference still falls short of real-time inference speeds by nearly four orders of magnitude. Cheetah further proposes an accelerator architecture to understand the degree of speedup hardware can provide and whether it can bridge HE’s real-time performance gap. We evaluate several DNNs and find that privacy-preserving HE inference for ResNet50 can approach real-time speeds with a 587mm2accelerator dissipating 30W in 5nm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 2×
“A. Homomorphic Encryption: The Basics HE is a privacy-preserving encryption technique that enables computation over encrypted data, which was first shown to be possible by Gentry [24].”
MethodThe Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
The emergence of edge computing
Satyanarayanan, M. (2017) · Computer · doi:10.1109/mc.2017.9 · Cited by 2,832
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Mohassel, P., & Zhang, Y. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.12 · Cited by 1,936 · cited 5×
“The threat model assumed by Cheetah is the same as in Gazelle [33], and similar to other two-party compute (2PC) solutions including DeepSecure [51], MiniONN [37], and SecureML [42].”
BackgroundMethodInfluentialRAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838
Cited by
A Metaverse: Taxonomy, Components, Applications, and Open Challenges
Park, S.-M., & Kim, Y.-G. (2022) · IEEE Access · doi:10.1109/access.2021.3140175 · Cited by 1,824
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network
Lee, J.-W., Kang, H., Lee, Y., Choi, W., Eom, J., Deryabin, M., Lee, E., Lee, J., Yoo, D., Kim, Y.-S., et al. (2022) · IEEE Access · doi:10.1109/access.2022.3159694 · Cited by 414
Self-citationSurvey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
“Subsequently, Gazelle was improved (i.e., 79 times faster) by Reagen et al. [326].”
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Samardzic, N., Feldmann, A., Krastev, A., Devadas, S., Dreslinski, R., Peikert, C., & Sanchez, D. (2021) · MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3466752.3480070 · Cited by 294
A Survey on Intelligent Internet of Things: Applications, Security, Privacy, and Future Directions
Aouedi, O., Vu, T.-H., Sacco, A., Nguyen, D. C., Piamrat, K., Marchetto, G., & Pham, Q.-V. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3430368 · Cited by 277
Metadata
- Authors
- Reagen, B., Choi, W.-S., Ko, Y., Lee, V. T., Lee, H.-H. S., Wei, G.-Y., & Brooks, D.
- Venue
- 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA)
- Publisher
- IEEE
- Published
- 2021-02
- Pages
- 26-39
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W3092440493
- Cited by
- 140
- References
- 13
- FWCI
- 11.48
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cheetah: Optimizing and Accelerating Homomorphic Encryption for Private Inference. https://app.cochat.ai/papers/10.1109/hpca51647.2021.00013
- The paper
- Reagen, B., Choi, W.-S., Ko, Y., Lee, V. T., Lee, H.-H. S., Wei, G.-Y., & Brooks, D. (2021). Cheetah: Optimizing and Accelerating Homomorphic Encryption for Private Inference. 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). https://doi.org/10.1109/hpca51647.2021.00013
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.