Private Learning for Vertical Decision Trees: A Secure, Accurate, and Fast Realization
- 16 June 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6088-6103
Abstract
Private learning for vertical decision trees (PVDT) is an emerging paradigm that allows multiple parties to execute cooperative training and inference of decision trees on vertically partitioned datasets, without revealing either party%'s data or model. The state-of-the-art PVDT schemes employ the secret-sharing-based secure multi-party computation (MPC) to admit low computational cost and low bandwidth. Nevertheless, existing schemes need many communication rounds for computing concrete protocols in PVDT, like the less-than comparison, division, etc. This property is not suited for large-communication-latency networks such as WAN. In this work, we present a two-party PVDT framework, called Swan, to enable a secure, accurate, and fast realization of vertical decision trees. At the core of Swan, we design a secure and parallel protocol for $N$-input multiplication with one communication round. This forms the cornerstone for a series of secure and communication-efficient computation protocols specifically tailored to less-than comparison and division. Along the way, we use these optimized protocols to refine the training and inference processes of PVDT, achieving a significant reduction in both communication costs and rounds. Experimental results show Swan provides top-notch accuracy, and achieves a $10.2\times$ and $2.8\times$ improvement in online training and inference latency over WAN compared to prior art.Keywords
Funding Information
- National Natural Science Foundation of China (62402358, 62302368, 62220106004)
- Technology Innovation Leading Program of Shaanxi (2023KXJ-033)
- Key R&D Program of Shandong Province of China (2023CXPT056)
- Young Talent Fund of Association for Science and Technology in Shaanxi, China (20240138)
- Open Topics from The Lion Rock Labs of Cyberspace Security (LRL24004)
- Open Project Foundation of Shaanxi Key Laboratory of Information Communication Network and Security (ICNS202301)
- Fundamental Research Funds for the Central Universities (ZDRC2202, ZYTS25081, KYFZ25005)
- Double First-Class Overseas Research Project of Xidian University
This publication has 40 references indexed in Scilit:
- Private Decision Tree Evaluation with Malicious Security via Function Secret Sharing2024
- On Fully-Secure Honest Majority MPC Without $n^2$ Round Overhead2023
- How to Simulate It – A Tutorial on the Simulation Proof Technique2017
- Classification and regression treesWIREs Data Mining and Knowledge Discovery, 2011
- Secure Computation with Fixed-Point Numbers2010
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima2009
- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation2006
- An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption2005
- Integrating Private Databases for Data Analysis2005
- Privacy Preserving Data Mining2000