Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision Tree
Lichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li, Wen-jie Lu, Shan Yin
Abstract
Gradient Boosting Decision Tree (GBDT) and its variants are widely used in industry. They have achieved remarkable success in numerous machine learning competitions and practical applications. Secure Multi-Party Computation (MPC) allows multiple data owners to compute a function jointly while keeping their input private. In this work, we present Gibbon, a secure two-party GBDT training framework on a vertically split dataset, where two data owners each hold different features of the same data samples. Compared with the state-of-the-art Squirrel (USENIX'Sec 2023), for most parameter settings, Gibbon achieves 2×-4× reduction in running time and 2×-3× reduction in communication.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 7869d947-a942-4485-bbf5-ff84b8432ed8Related papers
- Squirrel: A Scalable Secure Two-Party Computation Framework for Training Gradient Boosting Decision TreeWen-jie Lu, Zhicong Huang, Qizhi Zhang, Yuchen Wang et al.USENIX Security 2023
- SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoostZongda Han, Xiang Cheng, Wenhong Zhao, Jiaxin Fu et al.SIGMOD 2025 · 3 citations
- Federated Boosted Decision Trees with Differential PrivacySamuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple et al.CCS 2022 · 31 citations
- Practical Anonymous Two-Party Gradient Boosting Decision TreeChenyu Huang, Fan Zhang, Minxin Du, Sherman S. M. Chow et al.S&P 2026
- Practical Federated Gradient Boosting Decision TreesQinbin Li, Zeyi Wen, Bingsheng HeAAAI 2020 · 215 citations
