Cryptology ePrint Archive: Report 2021/1390

UC Secure Private Branching Program and Decision Tree Evaluation

Keyu Ji and Bingsheng Zhang and Tianpei Lu and Lichun Li and Kui Ren

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 multi-party computation platform for outsourced branching program and/or decision tree evaluation. We construct a constant-round protocol and a poly-round protocol. In particular, the overall (online + offline) communication cost of our poly-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 poly-round protocol is up to 15X faster in the LAN setting.

Category / Keywords: cryptographic protocols / branching program, decision tree

Date: received 14 Oct 2021, last revised 1 Nov 2021

Contact author: jikeyu at zju edu cn, bingsheng at zju edu cn

Available format(s): PDF | BibTeX Citation

Version: 20211101:022101 (All versions of this report)

Short URL: ia.cr/2021/1390


[ Cryptology ePrint archive ]