Cited by 94Privacy-Preserving Technologies in DataCryptography and Data SecurityInternet Traffic Analysis and Secure E-voting

Boosting Privately: Federated Extreme Gradient Boosting for Mobile Crowdsensing

Liu, Yang, Ma, Zhuo, Liu, Ximeng, Ma, Siqi, Nepal, Surya, Deng, Robert. H, Ren, Kui·2020·2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)

Abstract

Recently, Google and other 24 institutions proposed a series of open challenges towards federated learning (FL), which include application expansion and homomorphic encryption (HE). The former aims to expand the applicable machine learning models of FL. The latter focuses on who holds the secret key when applying HE to FL. For the naive HE scheme, the server is set to master the secret key. Such a setting causes a serious problem that if the server does not conduct aggregation before decryption, a chance is left for the server to access the user’s update. Inspired by the two challenges, we propose FEDXGB, a federated extreme gradient boosting (XGBoost) scheme supporting forced aggregation. FEDXGB mainly achieves the following two breakthroughs. First, FEDXGB involves a new HE based secure aggregation scheme for FL. By combining the advantages of secret sharing and homomorphic encryption, the algorithm can solve the second challenge mentioned above, and is robust to the user dropout. Then, FEDXGB extends FL to a new machine learning model by applying the secure aggregation scheme to the classification and regression tree building of XGBoost. Moreover, we conduct a comprehensive theoretical analysis and extensive experiments to evaluate the security, effectiveness, and efficiency of FEDXGB. The results indicate that FEDXGB achieves less than 1% accuracy loss compared with the original XGBoost, and can provide about 23.9% runtime and 33.3% communication reduction for HE based model update aggregation of FL.

Integrity signals

Registry

Crossref · 10.1109/icdcs47774.2020.00017

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

2 of the 29 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Liu, Y., Ma, Z., Liu, X., Ma, S., Nepal, S., Deng, R. H., & Ren, K.
Affiliations
  • Xidian University (CN)
  • Fuzhou University (CN)
  • Commonwealth Scientific and Industrial Research Organisation (AU)
  • Singapore Management University (SG)
  • Zhejiang University (CN)
Venue
2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)
Publisher
IEEE
Published
2020-11
Pages
1-11
OpenAlex
W3133312630
Cited by
93
References
29
Citations by year
2026: 10 · 2025: 8 · 2024: 22 · 2023: 13 · 2022: 27 · 2021: 10 · 2020: 3
FWCI
5.06
Type
conference paper
Language
en
Open access
closed
Locations
  • IEEE International Conference on Distributed Computing Systems (ICDCS) (publishedVersion)
  • Singapore Management University Institutional Knowledge (InK) (Singapore Management University) (submittedVersion)
Funders
National Natural Science Foundation of China
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
federated learning, extreme gradient boosting, homomorphic encryption, secure aggregation, secret sharing, mobile crowdsensing, privacy-preserving machine learning, communication efficiency

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review