Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring

Author(s):  
Hikaru Tsuchida ◽  
Takashi Nishide ◽  
Yusaku Maeda
Author(s):  
ARON LARSSON ◽  
JIM JOHANSSON ◽  
LOVE EKENBERG ◽  
MATS DANIELSON

We present a decision tree evaluation method for analyzing multi-attribute decisions under risk, where information is numerically imprecise. The approach extends the use of additive and multiplicative utility functions for supporting evaluation of imprecise statements, relaxing requirements for precise estimates of decision parameters. Information is modeled in convex sets of utility and probability measures restricted by closed intervals. Evaluation is done relative to a set of rules, generalizing the concept of admissibility, computationally handled through optimization of aggregated utility functions. Pros and cons of two approaches, and tradeoffs in selecting a utility function, are discussed.


2016 ◽  
Vol 2016 (4) ◽  
pp. 335-355 ◽  
Author(s):  
David J. Wu ◽  
Tony Feng ◽  
Michael Naehrig ◽  
Kristin Lauter

Abstract Decision trees and random forests are common classifiers with widespread use. In this paper, we develop two protocols for privately evaluating decision trees and random forests. We operate in the standard two-party setting where the server holds a model (either a tree or a forest), and the client holds an input (a feature vector). At the conclusion of the protocol, the client learns only the model’s output on its input and a few generic parameters concerning the model; the server learns nothing. The first protocol we develop provides security against semi-honest adversaries. We then give an extension of the semi-honest protocol that is robust against malicious adversaries. We implement both protocols and show that both variants are able to process trees with several hundred decision nodes in just a few seconds and a modest amount of bandwidth. Compared to previous semi-honest protocols for private decision tree evaluation, we demonstrate a tenfold improvement in computation and bandwidth.


Author(s):  
Liang Xue ◽  
Dongxiao Liu ◽  
Jianbing Ni ◽  
Xiaodong Lin ◽  
Xuemin Sherman Shen

Author(s):  
Lin Liu ◽  
Jinshu Su ◽  
Rongmao Chen ◽  
Jinrong Chen ◽  
Guangliang Sun ◽  
...  

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 103 ◽  
Author(s):  
Lin Liu ◽  
Jinshu Su ◽  
Baokang Zhao ◽  
Qiong Wang ◽  
Jinrong Chen ◽  
...  

With the fast development of the Internet of Things (IoT) technology, normal people and organizations can produce massive data every day. Due to a lack of data mining expertise and computation resources, most of them choose to use data mining services. Unfortunately, directly sending query data to the cloud may violate their privacy. In this work, we mainly consider designing a scheme that enables the cloud to provide an efficient privacy-preserving decision tree evaluation service for resource-constrained clients in the IoT. To design such a scheme, a new secure comparison protocol based on additive secret sharing technology is proposed in a two-cloud model. Then we introduce our privacy-preserving decision tree evaluation scheme which is designed by the secret sharing technology and additively homomorphic cryptosystem. In this scheme, the cloud learns nothing of the query data and classification results, and the client has no idea of the tree. Moreover, this scheme also supports offline users. Theoretical analyses and experimental results show that our scheme is very efficient. Compared with the state-of-art work, both the communication and computational overheads of the newly designed scheme are smaller when dealing with deep but sparse trees.


Sign in / Sign up

Export Citation Format

Share Document