[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-120113-en":3,"doc-seo-120113-105":30,"detail-sidebar-cat-0-en-105":83},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":27,"seo_description":14,"update_tm":28,"read_time":29},120113,8796095462418,"Noah","https://ap-avatar.wpscdn.com/avatar/80000253c1241d02b47?x-image-process=image/resize,m_fixed,w_180,h_180&k=1778826106357471780",8,"Research & Report","Recent advances of privacy-preserving machine learning based on (Fully) Homomorphic Encryption","Fully Homomorphic Encryption (FHE) enables computation directly on encrypted data without decryption, offering a practical route to address confidentiality and privacy in machine-learning systems. With many rapidly evolving FHE schemes and a growing body of FHE-based privacy-preserving machine learning (PPML) methods, it is difficult to form a complete comparative view. This article summarizes representative recent results, clarifies the strengths and limitations across solution types, and supports selecting an approach aligned with specific requirements and efficiency expectations.","Security and Safety, Vol. 4, 2024012 (2025)  \n[https://doi.org/10.1051/sands/2024012](https://doi.org/10.1051/sands/2024012)[ ](https://doi.org/10.1051/sands/2024012)[sands.edpsciences.org](sands.edpsciences.org)  \nSecurity and Safety of Data in Cloud Computing  \nOther Fields  \nRecent advances of privacy-preserving machine learning based on (Fully) Homomorphic Encryption  \nCheng Hong􀀃 Ant Group, Beijing 100081, China  \nReceived: 31 July 2024 / Revised: 9 September 2024 / Accepted: 10 September 2024 / Published online: 18 October 2024  \nAbstract Fully Homomorphic Encryption (FHE), known for its ability to process encrypted data without decryption, is a promising technique for solving privacy concerns in the machine learning era. However, there are many kinds of available FHE schemes and way more FHEbased solutions in the literature, and they are still fast evolving, making it di􀀎cult to geta complete view. This article aims to introduce recent representative results of FHE-based privacy-preserving machine learning, helping users understand the pros and cons of di􀀋erent  \nkinds of solutions, and choose an appropriate approach for their needs.  \nKeywords Homomorphic Encryption, Fully Homomorphic Encryption, Machine learning,  \nPrivacy-preserving machine learning  \nCitation Hong C. Recent advances of privacy-preserving machine learning based on (Fully) Homomorphic Encryption. Security and Safety 2025; 4: 2024012. [https://doi.org/10.1051/](https://doi.org/10.1051/)  \n[sands/2024012](sands/2024012)  \n1 Introduction  \nFully Homomorphic Encryption (FHE) is a technology that allows data manipulation in the encrypted domain without decryption. The idea of FHE was 􀀌rst introduced by Rivest et al. [1] in 1978, but it was not until 2008 that the 􀀌rst FHE scheme [2] was proposed by Gentry. FHE was considered just theoretic and impractical in its early ages, but today many di􀀋erent FHE schemes [3{7] have been proposed, with their e􀀎ciency greatly improved.  \nOne of the promising applications of FHE is that it could enable privacy-preserving machine learning (PPML) training or inference on encrypted data, protecting data con􀀌dentiality and privacy. There already exist many research works that use FHE to build PPML solutions, some of them even come close to the level of industrial deployments. Given di􀀋erent types of FHE schemes and machine learning tasks, the number of possible combinations is vast, and the area is still fast evolving, thus it's often di􀀎cult to answer the question below without enough investigation:  \nQ: Suppose I want to do privacy-preserving machine learning training/inference of model X on data Y using FHE. Are there any candidate methods for my use case? If yes, which one should I choose? What level of e􀀎ciency should I expect?  \nThis article tries to help users answer the question by providing a brief view of the recent research progresses of FHE-based PPML, help them choose research works to follow up, or decide whether the works are mature enough for their needs.  \n*  \nCorresponding author (email: [vince.hc@antgroup.com](vince.hc@antgroup.com))  \nThis is an Open Access article distributed under the terms of the Creative Commons Attribution License ([https://creativecommons.org/licenses/by/4.0](https://creativecommons.org/licenses/by/4.0)), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.  \n© The Author(s) 2025 . Published by EDP Sciences and China Science Publishing & Media Ltd.  \nSecurity and Safety, Vol. 4, 2024012  \nFigure 1 . Representative FHE schemes and applications. Numbers in small boxes refer to the generation of FHE, and `M'refers to mixed-mode FHE. Small boxes with white backgrounds refer to FHE schemes, and dark backgrounds refer to FHE applications  \nAccording to a talk by Gentry [8], existing FHE schemes could be divided into four generations as follows:  \n(1) The 􀀌rst generation FHE refers to Gentry's original design [2] based ","cbCain40F6qgSffM","https://ap.wps.com/l/cbCain40F6qgSffM","pdf",930478,1,7,"English","en",105,"# Introduction\n## Generations of FHE schemes\n# Second-generation FHE applications\n## CryptoNets","[{\"question\":\"Why can it be difficult to choose an FHE-based PPML method for a specific use case?\",\"answer\":\"Different FHE schemes and machine learning tasks create many possible combinations, and the field evolves quickly, so readers need guidance on candidate methods and realistic efficiency expectations.\"}]","Recent advances of privacy-preserving machine learning based on (Fully) Homomorphic Encryption | PDF",1785728266,18,{"code":4,"msg":31,"data":32},"ok",{"site_id":24,"language":23,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":78,"head_meta":80,"extra_data":82,"updated_unix":28},"recent-advances-of-privacy-preserving-machine-learning-based-on-fully-homomorphic-encryption","",{"@graph":36,"@context":77},[37,54,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,51],{"item":41,"name":42,"@type":43,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":50},"https://docshare.wps.com/document/research-report/",3,{"item":52,"name":13,"@type":43,"position":53},"https://docshare.wps.com/document/recent-advances-of-privacy-preserving-machine-learning-based-on-fully-homomorphic-encryption/120113/",4,{"url":52,"name":13,"@type":55,"author":56,"headline":13,"publisher":58,"fileFormat":61,"inLanguage":23,"description":14,"dateModified":62,"datePublished":62,"encodingFormat":61,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":57},"Person",{"url":41,"name":59,"@type":60},"DocShare","Organization","application/pdf","2026-08-03",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71],{"name":72,"@type":73,"acceptedAnswer":74},"Why can it be difficult to choose an FHE-based PPML method for a specific use case?","Question",{"text":75,"@type":76},"Different FHE schemes and machine learning tasks create many possible combinations, and the field evolves quickly, so readers need guidance on candidate methods and realistic efficiency expectations.","Answer","https://schema.org",{"og:url":52,"og:type":79,"og:title":13,"og:site_name":59,"og:description":14},"article",{"robots":81,"canonical":52},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":84},[85,89,93,97,102,107,111,114,119,122,126],{"id":20,"doc_module":4,"doc_module_name":46,"category_name":86,"show_sort_weight":87,"slug":88},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":90,"show_sort_weight":91,"slug":92},"Literature",80,"literature",{"id":53,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Exam",70,"exam",{"id":98,"doc_module":4,"doc_module_name":46,"category_name":99,"show_sort_weight":100,"slug":101},5,"Comic",60,"comic",{"id":103,"doc_module":4,"doc_module_name":46,"category_name":104,"show_sort_weight":105,"slug":106},6,"Technology",50,"technology",{"id":21,"doc_module":4,"doc_module_name":46,"category_name":108,"show_sort_weight":109,"slug":110},"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":112,"slug":113},30,"research-report",{"id":115,"doc_module":4,"doc_module_name":46,"category_name":116,"show_sort_weight":117,"slug":118},9,"Religion & Spirituality",20,"religion-spirituality",{"id":117,"doc_module":4,"doc_module_name":46,"category_name":120,"show_sort_weight":117,"slug":121},"World Cup","world-cup",{"id":123,"doc_module":4,"doc_module_name":46,"category_name":124,"show_sort_weight":123,"slug":125},10,"Lifestyle","lifestyle",{"id":127,"doc_module":4,"doc_module_name":46,"category_name":128,"show_sort_weight":98,"slug":129},19,"General","general"]