{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:30:43Z","timestamp":1764588643131,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>The requirement for privacy-aware machine learning increases as we continue to use PII (personally identifiable information) within machine training. To overcome the existing privacy issues, we can apply fully homomorphic encryption (FHE) to encrypt data before they are fed into a machine learning model. This involves generating a homomorphic encryption key pair, where the public key encrypts the input data and the private key decrypts the output. However, there is often a performance hit when we use homomorphic encryption, so this paper evaluates the performance overhead of using an SVM (support vector machine) machine learning technique with the OpenFHE homomorphic encryption library. This uses Python and the scikit-learn library to create an SVM model, which can then be used with homomorphically encrypted data inputs and then produce a homomorphically encrypted result. The experiments include a range of variables, such as multiplication depth, scale size, first modulus size, security level, batch size, and ring dimension, along with two different SVM models, SVM-poly and SVM-linear. Overall, the results show that the two main parameters that affect performance are ring dimension and modulus size, and SVM-poly and SVM-linear show similar performance levels.<\/jats:p>","DOI":"10.3390\/cryptography9020033","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T05:52:52Z","timestamp":1748325172000},"page":"33","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evaluation of Privacy-Preserving Support Vector Machine (SVM) Learning Using Homomorphic Encryption"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0809-3523","authenticated-orcid":false,"given":"William J.","family":"Buchanan","sequence":"first","affiliation":[{"name":"Blockpass ID Lab, Edinburgh Napier University, Edinburgh EH10 5DT, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0333-4757","authenticated-orcid":false,"given":"Hisham","family":"Ali","sequence":"additional","affiliation":[{"name":"Blockpass ID Lab, Edinburgh Napier University, Edinburgh EH10 5DT, UK"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,26]]},"reference":[{"unstructured":"Team, O.D. (2025, March 10). OpenFHE: Open-Source Fully Homomorphic Encryption Library. GitHub Repository. Available online: https:\/\/github.com\/openfheorg\/openfhe-development.","key":"ref_1"},{"key":"ref_2","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest","year":"1978","journal-title":"Found. Secur. Comput."},{"unstructured":"Gentry, C. (2025, March 11). A Fully Homomorphic Encryption Scheme. Available online: https:\/\/crypto.stanford.edu\/craig\/.","key":"ref_3"},{"doi-asserted-by":"crossref","unstructured":"Van Dijk, M., Gentry, C., Halevi, S., and Vaikuntanathan, V. (June, January 30). Fully homomorphic encryption over the integers. Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, France. Proceedings 29.","key":"ref_4","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/120868669","article-title":"Efficient fully homomorphic encryption from (standard) LWE","volume":"43","author":"Brakerski","year":"2014","journal-title":"SIAM J. Comput."},{"unstructured":"Cheon, J.H., Kim, A., Kim, M., and Song, Y. (2017, January 3\u20137). Homomorphic encryption for arithmetic of approximate numbers. Proceedings of the Advances in Cryptology\u2014ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China. Proceedings, Part I 23.","key":"ref_6"},{"unstructured":"Buchanan, W.J. (2024, September 04). Homomorphic Encryption (SEAL). Available online: https:\/\/asecuritysite.com\/seal.","key":"ref_7"},{"unstructured":"Buchanan, W.J. (2025, February 28). Homomorphic Encryption with BFV Using Node.js. Available online: https:\/\/asecuritysite.com\/seal\/js_homomorphic.","key":"ref_8"},{"key":"ref_9","first-page":"1","article-title":"Homomorphic encryption for machine learning in medicine and bioinformatics","volume":"53","author":"Wood","year":"2020","journal-title":"ACM Comput. Surv. CSUR"},{"doi-asserted-by":"crossref","unstructured":"Ducas, L., and Micciancio, D. (2015, January 26\u201330). FHEW: Bootstrapping homomorphic encryption in less than a second. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.","key":"ref_10","DOI":"10.1007\/978-3-662-46800-5_24"},{"unstructured":"Gentry, C. (June, January 31). Fully homomorphic encryption using ideal lattices. Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA.","key":"ref_11"},{"doi-asserted-by":"crossref","unstructured":"Iezzi, M. (2020, January 10\u201313). Practical privacy-preserving data science with homomorphic encryption: An overview. Proceedings of the 2020 IEEE International Conference on Big Data (Big Data), Atlanta, GA, USA.","key":"ref_12","DOI":"10.1109\/BigData50022.2020.9377989"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"11608","DOI":"10.1073\/pnas.1918257117","article-title":"Secure large-scale genome-wide association studies using homomorphic encryption","volume":"117","author":"Blatt","year":"2020","journal-title":"Proc. Natl. Acad. Sci. USA"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, T. (2023). Advancing Privacy and Accuracy with Federated Learning and Homomorphic Encryption. Authorea Prepr.","key":"ref_14","DOI":"10.36227\/techrxiv.24003795"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","article-title":"The Use of Multiple Measurements in Taxonomic Problems","volume":"7","author":"Fisher","year":"1936","journal-title":"Ann. Eugen."},{"unstructured":"Repository, U.M.L. (2025, March 17). Iris Dataset. Available online: https:\/\/archive.ics.uci.edu\/ml\/datasets\/iris.","key":"ref_16"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00994018","article-title":"Support-vector networks","volume":"20","author":"Cortes","year":"1995","journal-title":"Mach. Learn."},{"unstructured":"G\u00e9ron, A. (2019). Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow, O\u2019Reilly Media. [2nd ed.].","key":"ref_18"},{"doi-asserted-by":"crossref","unstructured":"Yin, Y., He, S., Zhang, R., Chang, H., and Zhang, J. (2025). Deep learning for iris recognition: A review. Neural Computing and Applications, Springer.","key":"ref_19","DOI":"10.1007\/s00521-025-11109-5"},{"key":"ref_20","first-page":"169","article-title":"On the Concrete Hardness of Learning with Errors","volume":"12","author":"Albrecht","year":"2018","journal-title":"J. Math. Cryptol."},{"unstructured":"Kim, A., Song, Y., and Cheon, J.H. (2018). Batching Methods for Homomorphic Encryption. Cryptol. Eprint Arch.","key":"ref_21"},{"doi-asserted-by":"crossref","unstructured":"Pinto, J.P., Kelur, S., and Shetty, J. (2018, January 27\u201328). Iris flower species identification using machine learning approach. Proceedings of the 2018 4th International Conference for Convergence in Technology (I2CT), Mangalore, India.","key":"ref_22","DOI":"10.1109\/I2CT42659.2018.9057891"},{"key":"ref_23","first-page":"483","article-title":"Fast Homomorphic Evaluation of Deep Discretized Neural Networks","volume":"Volume 10992","author":"Bourse","year":"2018","journal-title":"Advances in Cryptology\u2014CRYPTO 2018, Proceedings of the 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, 19\u201323 August 2018"},{"doi-asserted-by":"crossref","unstructured":"Halevi, S., and Shoup, V. (2014). Algorithms in HElib. Advances in Cryptology\u2014CRYPTO 2014, Proceedings of the 34th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2014, Springer.","key":"ref_24","DOI":"10.1007\/978-3-662-44371-2_31"},{"unstructured":"Team, M.S. (2025, March 27). Microsoft SEAL (Simple Encrypted Arithmetic Library). Available online: https:\/\/www.microsoft.com\/en-us\/research\/project\/microsoft-seal\/.","key":"ref_25"},{"unstructured":"Buchanan, W.J., and Ali, H. (2025). Partial and Fully Homomorphic Matching of IP Addresses Against Blacklists for Threat Analysis. arXiv.","key":"ref_26"},{"unstructured":"Dai, W., Deloingce, B., Chen, H., and Laine, K. (2012, January 10\u201312). Accelerating Fully Homomorphic Encryption Using GPU. Proceedings of the 26th IEEE International Symposium on High-Performance Computer Architecture (HPCA), Waltham, MA, USA.","key":"ref_27"},{"key":"ref_28","first-page":"1601","article-title":"Efficient Hybrid Homomorphic Encryption for Encrypted Machine Learning","volume":"19","author":"Mo","year":"2022","journal-title":"IEEE Trans. Dependable Secur. Comput."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/2\/33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:40:34Z","timestamp":1760031634000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/2\/33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":28,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["cryptography9020033"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9020033","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2025,5,26]]}}}