cs.CRcs.AI
Practical Anonymous Two-Party Gradient Boosting Decision Tree
May 26, 2026
This paper introduces a novel, efficient protocol for training Gradient Boosting Decision Trees (GBDT) on vertically partitioned data held by two mutually distrustful parties while ensuring complete anonymity by hiding record identifiers.
Structured data is well handled by gradient-boosted decision trees (GBDT), which are usually trained on vertically partitioned features across mutually distrustful parties. High speed and interpretability make GBDTs popular in finance and healthcare, where neural networks may fall short. Enabling secure computation for GBDTs poses unique challenges, requiring secure record alignment for comparison. Relying on private set intersection (PSI) is a de facto approach. Mistaking PSI for a safety measure actually exposes which record identifiers (IDs) are shared between the datasets. Although circuit-PSI could help, it is costly for generic uses. New ideas are needed to efficiently train in a "dark forest". Aiming to hide the IDs, we initiate the study of anonymous GBDT training on split data held by two parties. Dual circuit-PSI in our design lets the parties alternate as receiver to run pick-then-sum over local features. Via oblivious programmable pseudorandom functions, we propagate circuit-PSI outputs as shared state across runs. Avoiding universal alignment, we resolve the neglected dilemma that ID hiding incurs a cost that scales with domain size. Next, we halve the cost of ciphertext packing used to convert single-instruction multiple-data homomorphic encryption from (ring) learning with errors in prior secure GBDT (Usenix Security' 23) and related secure machine-learning computations. Comparative experiments show our protocol remains competitive with leaky approaches in efficiency. Enabling ID-hiding aggregation, our techniques can extend to other vertically partitioned analytics.
xDup: Privacy-Preserving Deduplication for Humanitarian Organizations using Fuzzy PSI
The paper introduces xDup, a fast and privacy-preserving system that enables hum…
Secure and Privacy-Preserving Vertical Federated Learning
The paper proposes an optimized, end-to-end privacy-preserving framework for ver…
Silent Guardians: Independent and Secure Decision Tree Evaluation Without Chatter
The paper proposes $\sf PVODTE$, a novel two-server protocol for private and ver…
Deep learning based intelligent IDS for Large-scale IoT networks
This paper proposes and evaluates two lightweight deep learning-based intelligen…
DDH-based schemes for multi-party Function Secret Sharing
The paper proposes a new DDH-based technique that significantly reduces the key…
Optimal Circuit Synthesis of Linear Codes for Error Detection and Correction
This paper introduces a novel algorithm, CiSC, to efficiently and optimally synt…
DDP-SA: Scalable Privacy-Preserving Federated Learning via Distributed Differential Privacy and Secu…
DDP-SA is a novel federated learning framework that combines local differential…
Trustless Provenance Trees: A Game-Theoretic Framework for Operator-Gated Blockchain Registries
The paper proposes a trustless framework using dual-layer cryptographic commitme…