.png){kind=icon}
.png){kind=icon}
Return
UC Secure Private Branching Program and Decision Tree Evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2022.3202916.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Branching program (BP) is a DAG-based non-uniform computational model for L/poly class. It has been widely used in formal verification, logic synthesis, and data analysis. As a special BP, a decision tree is a popular machine learning classifier for its effectiveness and simplicity. In this work, we propose a UC-secure efficient 3-party computation platform for outsourced branching program and/or decision tree evaluation. We construct a constant-round protocol and a linear-round protocol. In particular, the overall (online + offline) communication cost of our linear-round protocol is O(d(l + log m + log n)) and its round complexity is 2d-1, where m is the DAG size, n is the number of features, l is the feature length, and d is the longest path length. To enable efficient oblivious hopping among the DAG nodes, we propose a lightweight 1-out-of -N shared OT protocol with logarithmic communication in both online and offline phase. This partial result may be of independent interest to some other cryptographic protocols. Our benchmark shows, compared with the state-of-the-arts, the proposed constant-round protocol is up to 10X faster in the WAN setting, while the proposed linear-round protocol is up to 15X faster in the LAN setting.
Keywords:
Decision tree
privacy preserving
branching program
Journal
IF:
7.5
Papers:
2.4K
Citations:
9.6K