{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T13:55:37Z","timestamp":1782222937451,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:00:00Z","timestamp":1774051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T00:00:00Z","timestamp":1782172800000},"content-version":"vor","delay-in-days":94,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Key Laboratory of Computing Power Network and Information Security, Ministry of Education","award":["2024ZD011"],"award-info":[{"award-number":["2024ZD011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Extreme Gradient Boosting (XGBoost) is widely used due to its excellent learning performance. In real-world scenarios, data is often held by multiple owners, the sample size of a single data owner is usually insufficient for effectively training the model. Therefore, how to integrate data resources from different owners to collaboratively train a higher-performing model while ensuring data privacy has become an urgent problem that needs to be solved. To solve the above problems, we propose a privacy-preserving XGBoost scheme (PriXGB) with wide applicability and design a series of secure protocols for its key steps. We proposed a SecureArgmax protocol based on function secret sharing, which significantly improves the efficiency of securely computing the maximum value in the secret sequence while ensuring that intermediate information is not leaked. We designed a privacy sigmoid function protocol based on secret sharing to improve the accuracy of the model. In the vertical data partition scenario, PriXGB is roughly 30% more efficient than existing solutions. Finally, we provide security proofs for designed protocols and verify the advantages of the scheme through experiments. The experimental results show that PriXGB effectively protects data privacy while maintaining accuracy comparable to non-private XGBoost, thereby demonstrating strong security and effectiveness.<\/jats:p>","DOI":"10.1007\/s44443-026-00468-1","type":"journal-article","created":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T12:43:56Z","timestamp":1774097036000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PriXGB: Secure and accurate XGBoost training with function secret sharing for vertical and horizontal data partitioning"],"prefix":"10.1007","volume":"38","author":[{"given":"Chenlu","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ye","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,21]]},"reference":[{"key":"468_CR1","doi-asserted-by":"crossref","unstructured":"Abadi M, Chu A, Goodfellow I, McMahan HB, Mironov I, Talwar K, Zhang L (2016) Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 308\u2013318","DOI":"10.1145\/2976749.2978318"},{"key":"468_CR2","doi-asserted-by":"crossref","unstructured":"Abspoel M, Escudero D, Volgushev N (2021) Secure training of decision trees with continuous attributes. Proceedings on Privacy Enhancing Technologies","DOI":"10.2478\/popets-2021-0010"},{"key":"468_CR3","doi-asserted-by":"publisher","first-page":"15293","DOI":"10.1609\/aaai.v39i15.33678","volume":"39","author":"A Abourayya","year":"2025","unstructured":"Abourayya A, Kleesiek J, Rao K, Ayday E, Rao B, Webb GI, Kamp M (2025) Little is enough: Boosting privacy by sharing only hard labels in federated semi-supervised learning. Proceedings of the AAAI conference on artificial intelligence 39:15293\u201315301","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"issue":"3","key":"468_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3517197","volume":"25","author":"A Akavia","year":"2022","unstructured":"Akavia A, Leibovich M, Resheff YS, Ron R, Shahar M, Vald M (2022) Privacy-preserving decision trees training and prediction. ACM Transactions on Privacy and Security 25(3):1\u201330","journal-title":"ACM Transactions on Privacy and Security"},{"key":"468_CR5","doi-asserted-by":"crossref","unstructured":"Beaver D (1992) Efficient multiparty protocols using circuit randomization. In: Advances in Cryptology\u2014CRYPTO\u201991: Proceedings 11, pp. 420\u2013432. Springer","DOI":"10.1007\/3-540-46766-1_34"},{"key":"468_CR6","doi-asserted-by":"crossref","unstructured":"Boyle E, Gilboa N, Ishai Y (2015) Function secret sharing. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 337\u2013367. Springer","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"468_CR7","doi-asserted-by":"crossref","unstructured":"Boyle E, Gilboa N, Ishai Y (2019) Secure computation with preprocessing via function secret sharing. In: Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1\u20135, 2019, Proceedings, Part I 17, pp. 341\u2013371. Springer","DOI":"10.1007\/978-3-030-36030-6_14"},{"issue":"1","key":"468_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti R (2000) Security and composition of multiparty cryptographic protocols. J Cryptol 13(1):143\u2013202","journal-title":"J Cryptol"},{"key":"468_CR9","doi-asserted-by":"crossref","unstructured":"Cai H, Cai J, Sun L (2023) An adaptive gradient privacy-preserving algorithm for federated xgboost. In: Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning, pp. 277\u2013282","DOI":"10.1145\/3590003.3590051"},{"key":"468_CR10","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1016\/j.asoc.2018.09.029","volume":"73","author":"Y-C Chang","year":"2018","unstructured":"Chang Y-C, Chang K-H, Wu G-J (2018) Application of extreme gradient boosting trees in the construction of credit risk assessment models for financial institutions. Appl Soft Comput 73:914\u2013920","journal-title":"Appl Soft Comput"},{"issue":"6","key":"468_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/MIS.2021.3082561","volume":"36","author":"K Cheng","year":"2021","unstructured":"Cheng K, Fan T, Jin Y, Liu Y, Chen T, Papadopoulos D, Yang Q (2021) Secureboost: A lossless federated learning framework. IEEE Intell Syst 36(6):87\u201398","journal-title":"IEEE Intell Syst"},{"key":"468_CR12","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) Xgboost: A scalable tree boosting system. In: Proceedings of the 22nd Acm Sigkdd International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"468_CR13","doi-asserted-by":"crossref","unstructured":"Fan T, Chen W, Ma G, Kang Y, Fan L, Yang Q (2024) Secureboost+: Large scale and high-performance vertical federated gradient boosting decision tree. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 237\u2013249. Springer","DOI":"10.1007\/978-981-97-2259-4_18"},{"key":"468_CR14","doi-asserted-by":"publisher","first-page":"3709","DOI":"10.1109\/TIFS.2020.2997134","volume":"15","author":"Q Feng","year":"2020","unstructured":"Feng Q, He D, Liu Z, Wang H, Choo K-KR (2020) Securenlp: A system for multi-party privacy-preserving natural language processing. IEEE Trans Inf Forensics Secur 15:3709\u20133721","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"468_CR15","doi-asserted-by":"crossref","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Annals of statistics, 1189\u20131232","DOI":"10.1214\/aos\/1013203451"},{"key":"468_CR16","unstructured":"Fu C, Zhang X, Ji S, Chen J, Wu J, Guo S, Zhou J, Liu AX, Wang T (2022) Label inference attacks against vertical federated learning. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 1397\u20131414"},{"key":"468_CR17","doi-asserted-by":"crossref","unstructured":"Fang W, Zhao D, Tan J, Chen C, Yu C, Wang L, Wang L, Zhou J, Zhang B (2021) Large-scale secure xgb for vertical federated learning. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 443\u2013452","DOI":"10.1145\/3459637.3482361"},{"key":"468_CR18","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp. 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"issue":"110","key":"468_CR19","first-page":"1","volume":"78","author":"O Goldreich","year":"1998","unstructured":"Goldreich O (1998) Secure multi-party computation Manuscript Preliminary version 78(110):1\u2013108","journal-title":"Secure multi-party computation Manuscript Preliminary version"},{"issue":"1","key":"468_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3709723","volume":"3","author":"Z Han","year":"2025","unstructured":"Han Z, Cheng X, Zhao W, Fu J, He Z, Su S (2025) Securexgb: A secure and efficient multi-party protocol for vertical federated xgboost. Proceedings of the ACM on Management of Data 3(1):1\u201326","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"468_CR21","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1308\/147870804290","volume":"86","author":"J Holmes","year":"2004","unstructured":"Holmes J, Sacchi L, Bellazzi R et al (2004) Artificial intelligence in medicine. Ann R Coll Surg Engl 86:334\u20138","journal-title":"Ann R Coll Surg Engl"},{"key":"468_CR22","first-page":"994","volume":"34","author":"X Jin","year":"2021","unstructured":"Jin X, Chen P-Y, Hsu C-Y, Yu C-M, Chen T (2021) Cafe: Catastrophic data leakage in vertical federated learning. Adv Neural Inf Process Syst 34:994\u20131006","journal-title":"Adv Neural Inf Process Syst"},{"key":"468_CR23","doi-asserted-by":"crossref","unstructured":"Jiang Y, Mei F, Dai T, Li Y (2024) Sigbdt: Large-scale gradient boosting decision tree training via function secret sharing. In: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, pp. 274\u2013288","DOI":"10.1145\/3634737.3657024"},{"key":"468_CR24","doi-asserted-by":"crossref","unstructured":"Keller M (2020) Mp-spdz: A versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1575\u20131590","DOI":"10.1145\/3372297.3417872"},{"key":"468_CR25","unstructured":"Lu Wj, Huang Z, Zhang Q, Wang Y, Hong C (2023) Squirrel: a scalable secure $$\\{$$Two-Party$$\\}$$ computation framework for training gradient boosting decision tree. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 6435\u20136451"},{"key":"468_CR26","unstructured":"Le NK, Liu Y, Nguyen QM, Liu Q, Liu F, Cai Q, Hirche S (2021) Fedxgboost: Privacy-preserving xgboost for federated learning. arXiv:2106.10662"},{"key":"468_CR27","doi-asserted-by":"crossref","unstructured":"Liu Y, Ma Z, Liu X, Ma S, Nepal S, Deng R (2019) Boosting privately: Privacy-preserving federated extreme boosting for mobile crowdsensing. arXiv:1907.10218","DOI":"10.1109\/ICDCS47774.2020.00017"},{"key":"468_CR28","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining. In: Annual International Cryptology Conference, pp. 36\u201354. Springer","DOI":"10.1007\/3-540-44598-6_3"},{"key":"468_CR29","doi-asserted-by":"publisher","first-page":"4642","DOI":"10.1609\/aaai.v34i04.5895","volume":"34","author":"Q Li","year":"2020","unstructured":"Li Q, Wen Z, He B (2020) Practical federated gradient boosting decision trees. Proceedings of the AAAI Conference on Artificial Intelligence 34:4642\u20134649","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"468_CR30","doi-asserted-by":"crossref","unstructured":"Luo X, Wu Y, Xiao X, Ooi BC (2021) Feature inference attack on model predictions in vertical federated learning. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 181\u2013192. IEEE","DOI":"10.1109\/ICDE51399.2021.00023"},{"key":"468_CR31","unstructured":"McMahan B, Moore E, Ramage D, Hampson S, Arcas BA (2017) Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp. 1273\u20131282. PMLR"},{"key":"468_CR32","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223\u2013238. Springer","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"11","key":"468_CR33","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"468_CR34","doi-asserted-by":"crossref","unstructured":"Sagiroglu S, Sinanc D (2013) Big data: A review. In: 2013 International Conference on Collaboration Technologies and Systems (CTS), pp. 42\u201347. IEEE","DOI":"10.1109\/CTS.2013.6567202"},{"key":"468_CR35","doi-asserted-by":"crossref","unstructured":"Tian Z, Zhang R, Hou X, Lyu L, Zhang T, Liu J, Ren K (2023) Federboost: Private federated learning for gbdt. IEEE Transactions on Dependable and Secure Computing","DOI":"10.1109\/TDSC.2023.3276365"},{"key":"468_CR36","unstructured":"UCI Machine Learning Repository: UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/datasets. Accessed: 2025-04-06 (2024)"},{"key":"468_CR37","unstructured":"Wang F (2018) Libfss. https:\/\/github.com\/frankw2\/libfss"},{"key":"468_CR38","doi-asserted-by":"crossref","unstructured":"Wu Y, Cai S, Xiao X, Chen G, Ooi BC (2020) Privacy preserving vertical federated learning for tree-based models. arXiv:2008.06170","DOI":"10.14778\/3407790.3407811"},{"key":"468_CR39","unstructured":"Wang R, Ersoy O, Zhu H, Jin Y, Liang K (2022) Feverless: Fast and secure vertical federated learning based on xgboost for decentralized labels. IEEE Transactions on Big Data"},{"key":"468_CR40","doi-asserted-by":"crossref","unstructured":"Wang Y, Feng D, Li D, Chen X, Zhao Y, Niu X (2016) A mobile recommendation system based on logistic regression and gradient boosting decision trees. In: 2016 International Joint Conference on Neural Networks (IJCNN), pp. 1896\u20131902. IEEE","DOI":"10.1109\/IJCNN.2016.7727431"},{"key":"468_CR41","unstructured":"Xia Z, Gu Q, Zhou W, Xiong L, Weng J, Xiong N (2021) Str: Secure computation on additive shares using the share-transform-reveal strategy. IEEE Transactions on Computers"},{"issue":"5","key":"468_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3523061","volume":"13","author":"L Xie","year":"2022","unstructured":"Xie L, Liu J, Lu S, Chang T-H, Shi Q (2022) An efficient learning framework for federated xgboost using secret sharing and distributed optimization. ACM Transactions on Intelligent Systems and Technology (TIST) 13(5):1\u201328","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"468_CR43","doi-asserted-by":"crossref","unstructured":"Xu W, Zhu H, Zheng Y, Wang F, Zhao J, Liu Z, Li H (2024) Elxgb: An efficient and privacy-preserving xgboost for vertical federated learning. IEEE Transactions on Services Computing","DOI":"10.1109\/TSC.2024.3394706"},{"key":"468_CR44","doi-asserted-by":"crossref","unstructured":"Yao ACC (1986) How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (Sfcs 1986), pp. 162\u2013167. IEEE","DOI":"10.1109\/SFCS.1986.25"},{"key":"468_CR45","doi-asserted-by":"crossref","unstructured":"Yuan S, Li H, Qian X, Hao M, Zhai Y, Cui X (2023) Toward efficient and end-to-end privacy-preserving distributed gradient boosting decision trees. In: ICC 2023-IEEE International Conference on Communications, pp. 1566\u20131571. IEEE","DOI":"10.1109\/ICC45041.2023.10279189"},{"key":"468_CR46","doi-asserted-by":"crossref","unstructured":"Zhu Z, Du W (2010) Understanding privacy risk of publishing decision trees. In: IFIP Annual Conference on Data and Applications Security and Privacy, pp. 33\u201348. Springer","DOI":"10.1007\/978-3-642-13739-6_3"},{"key":"468_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2024.109686","volume":"227","author":"F Zhang","year":"2025","unstructured":"Zhang F, Wang L, Cui C, Meng Q, Yang M (2025) Evfex: An efficient vertical federated xgboost algorithm based on optimized secure matrix multiplication. Signal Process 227:109686","journal-title":"Signal Process"},{"issue":"7","key":"468_CR48","doi-asserted-by":"publisher","first-page":"152","DOI":"10.21037\/atm.2019.03.29","volume":"7","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Zhao Y, Canes A, Steinberg D, Lyashevska O et al (2019) Predictive analytics with gradient boosting in clinical medicine. Annals of translational medicine 7(7):152","journal-title":"Annals of translational medicine"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-026-00468-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00468-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00468-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T13:24:07Z","timestamp":1782221047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-026-00468-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,21]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s44443-026-00468-1","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,21]]},"assertion":[{"value":"6 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"249"}}