Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization
Guopeng Lin, Weili Han, Wenqiang Ruan, Ruisheng Zhou, Lushan Song, Bingshuai Li, Yunfeng Shao
摘要
Multi-party training frameworks for decision trees based on secure multi-party computation enable multiple parties to train highperformance models on distributed private data with privacy preservation. The training process essentially involves frequent dataset splitting according to the splitting criterion (e.g. Gini impurity). However, existing multi-party training frameworks for decision trees demonstrate communication inefficiency due to the following issues: (1) They suffer from huge communication overhead in securely splitting a dataset with continuous attributes. (2) They suffer from huge communication overhead due to performing almost all the computations on a large ring to accommodate the secure computations for the splitting criterion. In this paper, we are motivated to present an efficient three-party training framework, namely Ents, for decision trees by communication optimization. For the first issue, we present a series of training protocols based on the secure radix sort protocols [18] to efficiently and securely split a dataset with continuous attributes. For the second issue, we propose an efficient share conversion protocol to convert shares between a small ring and a large ring to reduce the communication overhead incurred by performing almost all the computations on a large ring. Experimental results from eight widely used datasets show that Ents outperforms stateof-the-art frameworks by 5.5× ∼ 9.3× in communication sizes and 3.9× ∼ 5.3× in communication rounds. In terms of training time, Ents yields an improvement of 3.5× ∼ 6.7×. To demonstrate its practicality, Ents requires less than three hours to securely train a decision tree on a widely used real-world dataset (Skin Segmentation) with more than 245,000 samples in the WAN setting. CCS CONCEPTS • Security and privacy → Privacy protections; • Computing methodologies → Machine learning.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Butterfly: Scalable Multi-Party Circuit-PSI via Triplet Zero-SharingRanyang Liu, Xiaojie Guo, Tong Li, Zheli LiuUSENIX Security 2026
- Practical Anonymous Two-Party Gradient Boosting Decision TreeChenyu Huang, Fan Zhang, Minxin Du, Sherman S. M. Chow 等S&P 2026
它引用的顶会 Paper16
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 被引用 898 次
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 被引用 404 次
- CryptGPU: Fast Privacy-Preserving Machine Learning on the GPUSijun Tan, Brian Knott, Yuan Tian, David J. WuS&P 2021 · 被引用 241 次
- New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine LearningIvan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller 等S&P 2019 · 被引用 182 次
- Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious SecurityAnders P. K. Dalskov, Daniel Escudero, Marcel KellerUSENIX Security 2021 · 被引用 174 次
相关 Paper
- Securely Training Decision Trees EfficientlyDivyanshu Bhardwaj, Sandhya Saravanan, Nishanth Chandran, Divya GuptaCCS 2024 · 被引用 2 次
- Federated Boosted Decision Trees with Differential PrivacySamuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple 等CCS 2022 · 被引用 31 次
- Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential PrivacyWenqiang Ruan, Mingxin Xu, Wenjing Fang, Li Wang 等S&P 2023
- Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision TreeLichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li 等CCS 2025
- Communication Efficient Secret Sharing with Dynamic Communication-Computation ConversionZhenghang Ren, Xiaodian Cheng, Mingxuan Fan, Junxue Zhang 等INFOCOM 2023 · 被引用 3 次
