2015
DOI: 10.1007/978-3-319-26059-4_20
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(24 citation statements)
references
References 40 publications
0
24
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 1 more Smart Citation
“…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%
“…The commodity-based model allows the realization of non-trivial functionality in the UC framework and has already been used to get very efficient secure computation protocols for tasks such as computing inner-products [29], [30] and other linear algebra operations [31], string equality [30], set intersection [30], oblivious polynomial evaluation [32] and verifiable secret sharing [33]. It was used in protocols for PPML [15], [19], [20]. In practice, this correlated randomness can be distributed by: (1) a single trusted server, (2) many not completely trusted servers (only a majority of honest servers is necessary [28]), or (3) pre-computed by the parties in an offline phase using an SMC protocol to emulate the trusted initializer (in this case the advantage is in offloading the heavy computation to be run at any idle time).…”
Section: B Cryptographic Preliminaries and Building Blocksmentioning
confidence: 99%
“…After preprocessing and feature extraction, we have 318,562 valid instances remaining in the set. The set is divided into 4 similar-sized age groups: (7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17)(18)(19)(20)(21)(22)(23)(24)(25)(26), (27)(28)(29)(30)(31)(32)(33)(34), (35)(36)(37)(38)(39)(40)(41)(42)(43), . For age classification, each instance will be classified into one age bucket.…”
Section: A Age and Gender Classificationmentioning
confidence: 99%
“…Cryptographically secure privacy-preserving SVM classification protocols have been proposed in [33], [5], [16], [10]. The basic idea behind these protocols is to decompose the task of scoring an SVM into smaller tasks and to implement each one of them in a privacy-preserving way.…”
Section: Adding Privacy To Our Classifiersmentioning
confidence: 99%
See 1 more Smart Citation