Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zongda Han

dblp:400/5162 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-2281-5767ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 56% Cryptographic protocols and secure computation · 44%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.912025
SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost · Proc. ACM Manag. Data 2025
Cryptographic protocols and secure computation
secure multiparty computation
0.912025
SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost · Proc. ACM Manag. Data 2025
Privacy and data protection › privacy-preserving machine learning › federated learning privacy
vertical federated learning
0.912025
SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost · Proc. ACM Manag. Data 2025
Privacy and data protection
privacy-preserving machine learning
0.312025
SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost · Proc. ACM Manag. Data 2025

Methods — techniques the papers use, named apart from their topics

synchronous best split selection · 1.7secret sharing · 1.7multi-party permutation · 1.7linear gain score · 1.7
YearPublicationVenuePosition
2025 SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost
abstract
Extreme Gradient Boosting (XGBoost) demonstrates excellent performance in practice and is widely used in both industry and academic research. This extensive application has led to a growing interest in employing multi-party data to develop more robust XGBoost models. In response to increasing concerns about privacy leakage, secure vertical federated XGBoost is proposed. It employs secure multi-party computation techniques, such as secret sharing (SS), to allow multiple parties holding vertically partitioned data, i.e., disjoint features on the same samples, to collaborate in constructing an XGBoost model. However, the running efficiency is the primary obstacle to the practical application of existing protocols, especially in multi-party settings. The reason is that these protocols not only require the execution of data-oblivious computations to protect intermediate results, leading to high computational complexity, but also involve a large number of SS-based non-linear operations with high overheads, e.g., division operations in gain score calculation and comparison operations in best split selection. To this end, we present a secure and efficient multi-party protocol for vertical federated XGBoost, called SecureXGB, which can perform the collaborative training of an XGBoost model in an SS-friendly manner. In SecureXGB, we first propose a parallelizable multi-party permutation method, which can secretly and efficiently permute all samples before model training to reduce the reliance on data-oblivious computations. Then, we design a linear gain score that can be evaluated without involving division operations and has equivalent utility to the original gain score. Finally, we develop a synchronous best split selection method to secretly identify the best split with the maximum gain score using a minimal number of comparison operations. Experimental results demonstrate that SecureXGB can achieve better training efficiency than state-of-the-art protocols without the loss of model accuracy.
Zongda Han, Xiang Cheng 0003, Wenhong Zhao, Jiaxin Fu, Zhaofeng He 0001, Sen Su
Proc. ACM Manag. Data1