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
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6f5a7678-9761-4e53-b0a8-a48bf8a356eaCited by top-tier papers2
- 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 et al.S&P 2026
Builds on16
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 898 citations
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 404 citations
- CryptGPU: Fast Privacy-Preserving Machine Learning on the GPUSijun Tan, Brian Knott, Yuan Tian, David J. WuS&P 2021 · 241 citations
- New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine LearningIvan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller et al.S&P 2019 · 182 citations
- Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious SecurityAnders P. K. Dalskov, Daniel Escudero, Marcel KellerUSENIX Security 2021 · 174 citations
Related papers
- Securely Training Decision Trees EfficientlyDivyanshu Bhardwaj, Sandhya Saravanan, Nishanth Chandran, Divya GuptaCCS 2024 · 2 citations
- Federated Boosted Decision Trees with Differential PrivacySamuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple et al.CCS 2022 · 31 citations
- Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential PrivacyWenqiang Ruan, Mingxin Xu, Wenjing Fang, Li Wang et al.S&P 2023
- Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision TreeLichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li et al.CCS 2025
- Communication Efficient Secret Sharing with Dynamic Communication-Computation ConversionZhenghang Ren, Xiaodian Cheng, Mingxuan Fan, Junxue Zhang et al.INFOCOM 2023 · 3 citations
