Efficient decision tree training with new data structure for secure multi-party computation

by   Koki Hamada, et al.

We propose a secure multi-party computation (MPC) protocol that constructs a secret-shared decision tree for a given secret-shared dataset. The previous MPC-based decision tree training protocol (Abspoel et al. 2021) requires O(2^hmnlog n) comparisons, being exponential in the tree height h and with n and m being the number of rows and that of attributes in the dataset, respectively. The cause of the exponential number of comparisons in h is that the decision tree training algorithm is based on the divide-and-conquer paradigm, where dummy rows are added after each split in order to hide the number of rows in the dataset. We resolve this issue via secure data structure that enables us to compute an aggregate value for every group while hiding the grouping information. By using this data structure, we can train a decision tree without adding dummy rows while hiding the size of the intermediate data. We specifically describes a decision tree training protocol that requires only O(hmnlog n) comparisons when the input attributes are continuous and the output attribute is binary. Note that the order is now linear in the tree height h. To demonstrate the practicality of our protocol, we implement it in an MPC framework based on a three-party secret sharing scheme. Our implementation results show that our protocol trains a decision tree with a height of 5 in 33 seconds for a dataset of 100,000 rows and 10 attributes.


page 1

page 2

page 3

page 4


Rethink Decision Tree Traversal

We will show how to implement binary decision tree traversal in the lang...

Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees

Secure multi-party computation (MPC) is a fundamental problem in secure ...

Scalable Private Decision Tree Evaluation with Sublinear Communication

Private decision tree evaluation (PDTE) allows a decision tree holder to...

Privacy-Preserving Training of Tree Ensembles over Continuous Data

Most existing Secure Multi-Party Computation (MPC) protocols for privacy...

GTree: GPU-Friendly Privacy-preserving Decision Tree Training and Inference

Decision tree (DT) is a widely used machine learning model due to its ve...

Secret Sharing MPC on FPGAs in the Datacenter

Multi-Party Computation (MPC) is a technique enabling data from several ...

Comparison communication protocols

We introduce a restriction of the classical 2-party deterministic commun...

Please sign up or login with your details

Forgot password? Click here to reset