Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision Tree
Lichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li, Wen-jie Lu, Shan Yin
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Squirrel: A Scalable Secure Two-Party Computation Framework for Training Gradient Boosting Decision TreeWen-jie Lu, Zhicong Huang, Qizhi Zhang, Yuchen Wang 等USENIX Security 2023
- SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoostZongda Han, Xiang Cheng, Wenhong Zhao, Jiaxin Fu 等SIGMOD 2025 · 被引用 3 次
- Federated Boosted Decision Trees with Differential PrivacySamuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple 等CCS 2022 · 被引用 31 次
- Practical Anonymous Two-Party Gradient Boosting Decision TreeChenyu Huang, Fan Zhang, Minxin Du, Sherman S. M. Chow 等S&P 2026
- Practical Federated Gradient Boosting Decision TreesQinbin Li, Zeyi Wen, Bingsheng HeAAAI 2020 · 被引用 215 次
