mlsanityData to 7 Oct 2026

Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization

arXiv 2406.07948 ↗First posted 12 Jun 2024cs.CR cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Multi-party training frameworks for decision trees based on secure multi-party computation enable multiple parties to train high-performance 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 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 state-of-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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 54 references that are in the map. First posted on arXiv 12 Jun 2024.

Builds on

10 of 54 references.

References · 10

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2021CryptGPU: Fast Privacy-Preserving Machine Learning on the GPUcited by 46
  3. 2021SIRNN: A Math Library for Secure RNN Inferencecited by 28
  4. 2021Privacy-Preserving Video Classification with Convolutional Neural Networkscited by 10
  5. 2022Private, Efficient, and Accurate: Protecting Models Trained by Multi-party Learning with Differential Privacycited by 7
  6. 2021Privacy-Preserving Training of Tree Ensembles over Continuous Datacited by 5
  7. 2016Quantum homomorphic encryption for polynomial-sized circuitscited by 4
  8. 2020MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attackcited by 3
  9. 2021Efficient decision tree training with new data structure for secure multi-party computationcited by 3
  10. 2022Bicoptor: Two-round Secure Three-party Non-linear Computation without Preprocessing for Privacy-preserving Machine Learningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.