Securely Training Decision Trees Efficiently
Divyanshu Bhardwaj, Sandhya Saravanan, Nishanth Chandran, Divya Gupta
Abstract
Decision trees are an important class of supervised learning algorithms. When multiple entities contribute data to train a decision tree (e.g. for fraud detection in the financial sector), data privacy concerns necessitate the use of a privacy-enhancing technology such as secure multi-party computation (MPC) in order to secure the underlying training data. Prior state-of-the-art (Hamada et al.[18]) construct an MPC protocol for decision tree training with a communication of O(hmN log N), when building a decision tree of height h for a training dataset of N samples, each having m attributes.
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 91dd5d99-f7df-417a-9427-9c72d5e07e8aCited by top-tier papers1
Ask how each one uses itRelated papers
- Ents: An Efficient Three-party Training Framework for Decision Trees by Communication OptimizationGuopeng Lin, Weili Han, Wenqiang Ruan, Ruisheng Zhou et al.CCS 2024 · 3 citations
- Federated Boosted Decision Trees with Differential PrivacySamuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple et al.CCS 2022 · 31 citations
- Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision TreeLichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li et al.CCS 2025
- The Influence of Dimensions on the Complexity of Computing Decision TreesStephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk et al.AAAI 2023 · 14 citations
- The Value of Collaboration in Convex Machine Learning with Differential PrivacyNan Wu, Farhad Farokhi, David B. Smith, Mohamed Ali KâafarS&P 2020 · 112 citations
