.png){kind=icon}
.png){kind=icon}
Return
ESecDT: Communication-Efficient and Secure Decision Tree Training Framework
.png){kind=icon}
PRE
AI
DOI：10.1109/tifs.2026.3723108.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decision trees are widely used in various domains, such as user behavior analysis and financial risk assessment. Recently, increasing concerns about data privacy have driven the development of secure decision tree training frameworks. We propose ESecDT, a novel framework that enables collaborative decision tree training while preserving participants’ training data. ESecDT integrates the computational advantages of Function Secret Sharing (FSS) and Replicated Secret Sharing (RSS) through a co-design approach. We first introduce new protocols based on this co-design for tree training building blocks, including GroupSum, GroupPrefixSum, and VecMMax. Subsequently, we design a bit-width-aware training framework that manages data with different bit-widths and supports FSS key reuse. These designs enable ESecDT to ensure strong privacy guarantees, preserving the training data and all intermediate variables throughout the training process, while maintaining practical efficiency. Extensive experiments on nine real-world and synthetic datasets demonstrate that ESecDT reduces online communication overhead by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4.25\times $ </tex-math></inline-formula>–<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$5.56\times $ </tex-math></inline-formula> versus state-of-the-art frameworks. In the WAN setting, ESecDT achieves <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1.78\times $ </tex-math></inline-formula>–<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4.48\times $ </tex-math></inline-formula> speedup in training runtime and completes a 30,000-sample training task in less than half an hour, demonstrating strong potential for practical deployment.
Keywords:
Privacy-preserving
decision tree training
secure multiparty computation
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W