Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.02224 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912360967438336 |
|---|---|
| author | Quijano, Andrew Halkidis, Spyros T. Gallagher, Kevin Akkaya, Kemal Samaras, Nikolaos |
| author_facet | Quijano, Andrew Halkidis, Spyros T. Gallagher, Kevin Akkaya, Kemal Samaras, Nikolaos |
| contents | A decision tree is an easy-to-understand tool that has been widely used for classification tasks. On the one hand, due to privacy concerns, there has been an urgent need to create privacy-preserving classifiers that conceal the user's input from the classifier. On the other hand, with the rise of cloud computing, data owners are keen to reduce risk by outsourcing their model, but want security guarantees that third parties cannot steal their decision tree model. To address these issues, Joye and Salehi introduced a theoretical protocol that efficiently evaluates decision trees while maintaining privacy by leveraging their comparison protocol that is resistant to timing attacks. However, their approach was not only inefficient but also prone to side-channel attacks. Therefore, in this paper, we propose a new decision tree inference protocol in which the model is shared and evaluated among multiple entities. We partition our decision tree model by each level to be stored in a new entity we refer to as a "level-site." Utilizing this approach, we were able to gain improved average run time for classifier evaluation for a non-complete tree, while also having strong mitigations against side-channel attacks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02224 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Enhanced Outsourced and Secure Inference for Tall Sparse Decision Trees Quijano, Andrew Halkidis, Spyros T. Gallagher, Kevin Akkaya, Kemal Samaras, Nikolaos Cryptography and Security Machine Learning A decision tree is an easy-to-understand tool that has been widely used for classification tasks. On the one hand, due to privacy concerns, there has been an urgent need to create privacy-preserving classifiers that conceal the user's input from the classifier. On the other hand, with the rise of cloud computing, data owners are keen to reduce risk by outsourcing their model, but want security guarantees that third parties cannot steal their decision tree model. To address these issues, Joye and Salehi introduced a theoretical protocol that efficiently evaluates decision trees while maintaining privacy by leveraging their comparison protocol that is resistant to timing attacks. However, their approach was not only inefficient but also prone to side-channel attacks. Therefore, in this paper, we propose a new decision tree inference protocol in which the model is shared and evaluated among multiple entities. We partition our decision tree model by each level to be stored in a new entity we refer to as a "level-site." Utilizing this approach, we were able to gain improved average run time for classifier evaluation for a non-complete tree, while also having strong mitigations against side-channel attacks. |
| title | Enhanced Outsourced and Secure Inference for Tall Sparse Decision Trees |
| topic | Cryptography and Security Machine Learning |
| url | https://arxiv.org/abs/2505.02224 |