Private yet Efficient Decision Tree Evaluation - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Private yet Efficient Decision Tree Evaluation

(1) , (2)
1
2
Marc Joye
  • Function : Author
  • PersonId : 1040494
Fariborz Salehi
  • Function : Author
  • PersonId : 1040495

Abstract

Decision trees are a popular method for a variety of machine learning tasks. A typical application scenario involves a client providing a vector of features and a service provider (server) running a trained decision-tree model on the client’s vector. Both inputs need to be kept private. In this work, we present efficient protocols for privately evaluating decision trees. Our design reduces the complexity of existing solutions with a more interactive setting, which improves the total number of comparisons to evaluate the decision tree. It crucially uses oblivious transfer protocols and leverages their amortized overhead. Furthermore, and of independent interest, we improve by roughly a factor of two the DGK comparison protocol.
Fichier principal
Vignette du fichier
470961_1_En_16_Chapter.pdf (422.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01954407 , version 1 (13-12-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Marc Joye, Fariborz Salehi. Private yet Efficient Decision Tree Evaluation. 32th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2018, Bergamo, Italy. pp.243-259, ⟨10.1007/978-3-319-95729-6_16⟩. ⟨hal-01954407⟩
88 View
151 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More