2019
DOI: 10.1109/tdsc.2017.2679189
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
108
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 117 publications
(110 citation statements)
references
References 39 publications
0
108
0
Order By: Relevance
“…Non-application specific protocols were designed just lately. Bost et al [17] introduced privacypreserving protocols for hyperplane-based, Naive Bayes and DT classifiers, Wu et al [18] for DTs and RFs, David et al [19] for hyperplane-based and Naive Bayes classifiers, and De Cock et al [20] for DTs and hyperplane-based classifiers. De Hoogh et al [14] had also previously presented a protocol for privacy-preserving scoring of DTs with categorical attributes.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…Non-application specific protocols were designed just lately. Bost et al [17] introduced privacypreserving protocols for hyperplane-based, Naive Bayes and DT classifiers, Wu et al [18] for DTs and RFs, David et al [19] for hyperplane-based and Naive Bayes classifiers, and De Cock et al [20] for DTs and hyperplane-based classifiers. De Hoogh et al [14] had also previously presented a protocol for privacy-preserving scoring of DTs with categorical attributes.…”
Section: Related Workmentioning
confidence: 99%
“…De Hoogh et al [14] had also previously presented a protocol for privacy-preserving scoring of DTs with categorical attributes. The protocol for privacy-preserving scoring of DTs of De Cock et al [20] cannot be directly used as a building block to obtain random forests and boosted decision trees. We present in Section III a modified protocol for scoring decision trees that does the job.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The calculation in the training and the test phase is very complicated when SOM as the classifier which requires multiple vector multiplications, or more complex divition. Secure Multi-party Computation (SMC) [23], [24] may enable secure cross-domain anomaly detection (e.g., secure addition protocol, secure multiplication protocol and secure compare protocol). However, these protocols require a large amount of interaction from the participants and calculations on ciphertext, which undoubtedly consumes many of the controller's bandwidth.…”
Section: Introductionmentioning
confidence: 99%