%0 Conference Proceedings
%T Private yet Efficient Decision Tree Evaluation
%+ NXP Semiconductors
%+ California Institute of Technology (CALTECH)
%A Joye, Marc
%A Salehi, Fariborz
%Z Part 5: Security Analysis and Private Evaluation
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 32th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Bergamo, Italy
%Y Florian Kerschbaum
%Y Stefano Paraboschi
%I Springer International Publishing
%3 Data and Applications Security and Privacy XXXII
%V LNCS-10980
%P 243-259
%8 2018-07-16
%D 2018
%R 10.1007/978-3-319-95729-6_16
%K Data mining
%K Privacy
%K Integer comparison
%K Decision trees
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01954407/document
%2 https://inria.hal.science/hal-01954407/file/470961_1_En_16_Chapter.pdf
%L hal-01954407
%U https://inria.hal.science/hal-01954407
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-LNCS-10980