The DOI matches its Crossref record; 114 of the 118 references it cites were found in a registry or an index.
Privacy-preserving neural networks with Homomorphic encryption: Challenges and opportunities
Open accessAbstract
Classical machine learning modeling demands considerable computing power for internal calculations and training with big data in a reasonable amount of time. In recent years, clouds provide services to facilitate this process, but it introduces new security threats of data breaches. Modern encryption techniques ensure security and are considered as the best option to protect stored data and data in transit from an unauthorized third-party. However, a decryption process is necessary when the data must be processed or analyzed, falling into the initial problem of data vulnerability. Fully Homomorphic Encryption (FHE) is considered the holy grail of cryptography. It allows a non-trustworthy third-party resource to process encrypted information without disclosing confidential data. In this paper, we analyze the fundamental concepts of FHE, practical implementations, state-of-the-art approaches, limitations, advantages, disadvantages, potential applications, and development tools focusing on neural networks. In recent years, FHE development demonstrates remarkable progress. However, current literature in the homomorphic neural networks is almost exclusively addressed by practitioners looking for suitable implementations. It still lacks comprehensive and more thorough reviews. We focus on the privacy-preserving homomorphic encryption cryptosystems targeted at neural networks identifying current solutions, open issues, challenges, opportunities, and potential research directions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“To address these challenges, hybrid PPML frameworks could leverage lightweight HE variants (like CKKS for approximate arithmetic) with hierarchical FL architectures [17, 109, 149], distributing computation across edge devices, RSUs, and cloud servers to minimize latency.”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [109]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“HE, though theoretically robust, introduces prohibitive latency in large-scale traffic simulations due to polynomial-degree ciphertext operations, conflicting with sub-second response requirements for dynamic traffic management [2, 109, 132].”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [109]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Moreover, HE's reliance on lattice -based cryptography introduces latency from ciphertext expansion, especially in inference [109].”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [109]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“GPU-accelerated HE libraries tailored for CKKS/BFV schemes could expedite encrypted inference, while Chebyshev polynomial approximations may enable HE-compatible ReLU activations [109].”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [109]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“HE allows arithmetic operations on ciphertexts but struggles with non-linear functions (like ReLU) due to polynomial approximations [109].”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [109]
The cited source says what the claim attributes to it.
In the citing paper
“GPU-accelerated HE libraries tailored for CKKS/BFV schemes could expedite encrypted inference, while Chebyshev polynomial approximations may enable HE-compatible ReLU activations [109].”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [109]
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
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.01703 · Cited by 31,473
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Caffe: Convolutional Architecture for Fast Feature Embedding
Jia, Y., Shelhamer, E., Donahue, J., Karayev, S., Long, J., Girshick, R., Guadarrama, S., & Darrell, T. (2014) · Proceedings of the 22nd ACM international conference on Multimedia · doi:10.1145/2647868.2654889 · Cited by 11,077
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,865
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Dlib-ml: A Machine Learning Toolkit
King, D. E. (2009) · Journal of machine learning research · doi:10.5555/1577069.1755843 · Cited by 2,945
Research works printed but not linked: 9
- Minelli M (2018) Fully homomorphic encryption for machine learning. In: PSL Research University. PhD Thesis, Paris
- Sobitha Ahila S, Shunmuganathan KL (2014) State of art in Homomorphic encryption schemes. Int J Eng Res Appl 4:37–43
- Takabi H, Hesamifard E, Ghasemi M (2016) Privacy preserving multi-party machine learning with Homomorphic encryption. In: 29th Annual Conference on Neural Information Processing Systems (NIPS). Barcelona, Spain
- Rondeau T (2020) Data protection in virtual environments (DPRIVE). DARPA/MTO, Technical report
- Halevi S, Shoup V (2013) Design and implementation of a Homomorphic-encryption library. IBM Res 6:12–15
- Tokui S, Oono K, Hido S, Clayton J (2015) Chainer: a next-generation open source framework for deep learning. In: Proceedings of the Workshop on Machine Learning Systems (LearningSys) at the 28th Annual Conference on Neural Information Processing Systems (NIPS), pp 1-6. http://learningsys.org/papers/LearningSys_2015_paper_33.pdf
- Abadi M, Agarwal A, Barham P, Brevdo E (1603) Large-Scale Machine Learning on Heterogeneous Systems. arXiv, Xiaoqiang Z TensorFlow, p 04467
- Bergstra J, Bastien F, Breuleux O, Lamblin P, Pascanu R, Delalleau O, Bengio Y (2011) Theano: deep learning on GPU with Python. J Mach Learn Res 1:1–48
- Ryffel T, Trask A, Dahl M, Wagner B (1811) Mancuso J. Passerat-Palmbach J A generic framework for privacy preserving deep learning. arXiv, Rueckert D, p 04017
Cited by
Sorted by citations
Privacy–Enhancing Face Biometrics: A Comprehensive Survey
Meden, B., Rot, P., Terhörst, P., Damer, N., Kuijper, A., Scheirer, W. J., Ross, A. A., Peer, P., & Štruc, V. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3096024 · Cited by 226
Recent methodological advances in federated learning for healthcare
Zhang, F., Kreuter, D., Chen, Y., Dittmer, S., Tull, S., Shadbahr, T., Schut, M. C., Asselbergs, F. W., Kar, S., Sivapalaratnam, S., et al. (2024) · Patterns · doi:10.1016/j.patter.2024.101006 · Cited by 152
A Review of Homomorphic Encryption for Privacy-Preserving Biometrics
Yang, W., Wang, S., Cui, H., Tang, Z., & Li, Y. (2023) · Sensors · doi:10.3390/s23073566 · Cited by 126
Fouda, M. M., Fadlullah, Z. M., Ibrahem, M. I., & Kato, N. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3486690 · Cited by 103
Podschwadt, R., Takabi, D., Hu, P., Rafiei, M. H., & Cai, Z. (2022) · IEEE Access · doi:10.1109/access.2022.3219049 · Cited by 99
Metadata
- Authors
- Pulido-Gaytan, B., Tchernykh, A., Cortés-Mendoza, J. M., Babenko, M., Radchenko, G., Avetisyan, A., & Drozdov, A. Y.
- Affiliations
- South Ural State University (RU)
- North-Caucasus Federal University (RU)
- Institute for System Programming (RU)
- Moscow Institute of Physics and Technology (RU)
- Corresponding author
- Tchernykh, Andrei
- ORCID
- Venue
- Peer-to-Peer Networking and Applications
- Published
- 2021-03-08
- Volume
- 14
- Issue
- 3
- Pages
- 1666-1691
- ISSN
- 1936-6442 (ISSN-L)
- 1936-6450
- OpenAlex
- W3134210339
- Cited by
- 126
- References
- 118
- Citations by year
- 2026: 18 · 2025: 33 · 2024: 27 · 2023: 29 · 2022: 13 · 2021: 6
- FWCI
- 6.63
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- Peer-to-Peer Networking and Applications (publishedVersion, cc-by)
- Funders
- Ministry of Education and Science of the Russian Federation (075-15-2020-788)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Keywords
- fully homomorphic encryption, privacy-preserving machine learning, encrypted data processing, cloud security, data breaches, ciphers
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
