{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T00:49:22Z","timestamp":1779929362353,"version":"3.53.1"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program, China","award":["2017YFE0119300"],"award-info":[{"award-number":["2017YFE0119300"]}]},{"DOI":"10.13039\/501100012271","name":"Shenzhen Fundamental Research Fund","doi-asserted-by":"crossref","award":["JCYJ20190813171003723"],"award-info":[{"award-number":["JCYJ20190813171003723"]}],"id":[{"id":"10.13039\/501100012271","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61731018"],"award-info":[{"award-number":["61731018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2022,10,31]]},"abstract":"<jats:p>XGBoost is one of the most widely used machine learning models in the industry due to its superior learning accuracy and efficiency. Targeting at data isolation issues in the big data problems, it is crucial to deploy a secure and efficient federated XGBoost (FedXGB) model. Existing FedXGB models either have data leakage issues or are only applicable to the two-party setting with heavy communication and computation overheads. In this article, a lossless multi-party federated XGB learning framework is proposed with a security guarantee, which reshapes the XGBoost\u2019s split criterion calculation process under a secret sharing setting and solves the leaf weight calculation problem by leveraging distributed optimization. Remarkably, a thorough analysis of model security is provided as well, and multiple numerical results showcase the superiority of the proposed FedXGB compared with the state-of-the-art models on benchmark datasets.<\/jats:p>","DOI":"10.1145\/3523061","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T12:54:01Z","timestamp":1652964841000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["An Efficient Learning Framework for Federated XGBoost Using Secret Sharing and Distributed Optimization"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6885-633X","authenticated-orcid":false,"given":"Lunchen","family":"Xie","sequence":"first","affiliation":[{"name":"School of Software Engineering, Tongji University, Jiading District, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-3230","authenticated-orcid":false,"given":"Jiaqi","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Tongji University, Jiading District, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9256-9648","authenticated-orcid":false,"given":"Songtao","family":"Lu","sequence":"additional","affiliation":[{"name":"IBM Research AI, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1349-2764","authenticated-orcid":false,"given":"Tsung-Hui","family":"Chang","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China and Shenzhen Research Institute of Big Data, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0507-9080","authenticated-orcid":false,"given":"Qingjiang","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Tongji University, China and Shenzhen Research Institute of Big Data, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648589"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2627438"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054192"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"e_1_3_3_7_2","unstructured":"Jakub Kone\u010dn\u1ef3 H. Brendan McMahan Felix X. Yu Peter Richt\u00e1rik Ananda Theertha Suresh and Dave Bacon. 2016. Federated learning: Strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492."},{"key":"e_1_3_3_8_2","unstructured":"Stephen Hardy Wilko Henecka Hamish Ivey-Law Richard Nock Giorgio Patrini Guillaume Smith and Brian Thorne. 2017. Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. arXiv preprint arXiv:1711.10677 2017."},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","unstructured":"Yang Liu Zhuo Ma Ximeng Liu Siqi Ma Surya Nepal and Robert Deng. 2019. Boosting privately: Privacy-preserving federated extreme boosting for mobile crowdsensing. arXiv preprint arXiv:1907.10218.","DOI":"10.1109\/ICDCS47774.2020.00017"},{"key":"e_1_3_3_10_2","unstructured":"Kewei Cheng Tao Fan Yilun Jin Yang Liu Tianjian Chen and Qiang Yang. 2019. Secureboost: A lossless federated learning framework. arXiv preprint arXiv:1901.08755."},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403298"},{"key":"e_1_3_3_12_2","unstructured":"Wenjing Fang Chaochao Chen Jin Tan Chaofan Yu Yufei Lu Li Wang Lei Wang Jun Zhou et\u00a0al. 2020. A hybrid-domain framework for secure gradient tree boosting. arXiv preprint arXiv:2005.08479."},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Zhi Feng Haoyi Xiong Chuanyuan Song Sijia Yang Baoxin Zhao Licheng Wang Zeyu Chen Shengwen Yang Liping Liu and Jun Huan. 2020. SecureGBM: Secure multi-party gradient boosting. In 2019 IEEE International Conference on Big Data (Big Data) .","DOI":"10.1109\/BigData47090.2019.9006000"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2020.2992755"},{"key":"e_1_3_3_15_2","unstructured":"C. Leung A. Law and O. Sima. 2019. Towards privacy-preserving collaborative gradient boosted decision trees. Tech. Rep. UC Berkeley."},{"key":"e_1_3_3_16_2","volume-title":"A Fully Homomorphic Encryption Scheme","author":"Gentry Craig","year":"2009","unstructured":"Craig Gentry et\u00a0al. 2009. A Fully Homomorphic Encryption Scheme. Vol. 20. Stanford University Stanford."},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","unstructured":"George Robert Blakley. 1979. Safeguarding cryptographic keys. Managing Requirements Knowledge International Workshop . IEEE Computer Society 313\u2013313.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.07.009"},{"issue":"1","key":"e_1_3_3_19_2","first-page":"125","article-title":"Privacy-preserving analysis of vertically partitioned data using secure matrix products","volume":"25","author":"Karr Alan F.","year":"2009","unstructured":"Alan F. Karr, Xiaodong Lin, Ashish P. Sanil, and Jerome P. Reiter. 2009. Privacy-preserving analysis of vertically partitioned data using secure matrix products. Journal of Official Statistics 25, 1 (2009), 125.","journal-title":"Journal of Official Statistics"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0053"},{"key":"e_1_3_3_21_2","unstructured":"Yang Liu Zhuo Ma Ximeng Liu Zhuzhu Wang Siqi Ma and Ken Ren. 2019. Revocable federated learning: A benchmark of federated forest. arXiv preprint arXiv:1911.03242."},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_74"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_3_24_2","unstructured":"Zhuzhu Wang Yilong Yang Yang Liu Ximeng Liu Brij B. Gupta and Jianfeng Ma. 2020. Cloud-based federated boosting for mobile crowdsensing. arXiv preprint arXiv:2005.05304."},{"key":"e_1_3_3_25_2","volume-title":"Applications of Division by Convergence","author":"Goldschmidt Robert E.","year":"1964","unstructured":"Robert E. Goldschmidt. 1964. Applications of Division by Convergence. Ph.D. thesis. Massachusetts Institute of Technology."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_3_28_2","first-page":"19","volume-title":"Security & Privacy","author":"Mohassel Payman","year":"2017","unstructured":"Payman Mohassel and Yupeng Zhang. 2017. SecureML: A system for scalable privacy-preserving machine learning. In Security & Privacy. 19\u201338."},{"key":"e_1_3_3_29_2","doi-asserted-by":"crossref","unstructured":"O. Goldreich. 2004. Basic application. foundations of cryptography Vol. 2.","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","unstructured":"K. Cheng L. Wang Y. Shen H. Wang Y. Wang X. Jiang and H. Zhong. 2017. Secure k-NN query on encrypted cloud data with multiple keys. IEEE Transactions on Big Data 7 4 (2017) 689\u2013702.","DOI":"10.1109\/TBDATA.2017.2707552"},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"P. Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes. Proc. EUROCRYPT\u201999 Czech Republic. Vol. 1592 223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advwatres.2011.04.013"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3523061","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3523061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:17Z","timestamp":1750188617000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3523061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,23]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10,31]]}},"alternative-id":["10.1145\/3523061"],"URL":"https:\/\/doi.org\/10.1145\/3523061","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,23]]},"assertion":[{"value":"2021-04-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-28","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}