Paper 2021/1390
UC Secure Private Branching Program and Decision Tree Evaluation
Abstract
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(\ell + \log m+\log n))$ and its round complexity is $2d-1$, where $m$ is the DAG size, $n$ is the number of features, $\ell$ 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.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. IEEE Transactions on Dependable and Secure Computing
- DOI
- 10.1109/TDSC.2022.3202916
- Keywords
- branching program decision tree
- Contact author(s)
-
jikeyu @ zju edu cn
bingsheng @ zju edu cn - History
- 2022-11-01: last of 4 revisions
- 2021-10-15: received
- See all versions
- Short URL
- https://ia.cr/2021/1390
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1390, author = {Keyu Ji and Bingsheng Zhang and Tianpei Lu and Lichun Li and Kui Ren}, title = {{UC} Secure Private Branching Program and Decision Tree Evaluation}, howpublished = {Cryptology {ePrint} Archive, Paper 2021/1390}, year = {2021}, doi = {10.1109/TDSC.2022.3202916}, url = {https://eprint.iacr.org/2021/1390} }