Kangaroo: A Private and Amortized Inference Framework over WAN for Large-Scale Decision Tree Evaluation
Wei Xu, Hui Zhu, Yandong Zheng, Song Bian, Ning Sun, Hao Yuan, Dengguo Feng, Hui Li
Abstract
With the rapid adoption of Models-as-a-Service, concerns about data and model privacy have become increasingly critical. To solve these problems, various privacy-preserving inference schemes have been proposed. In particular, due to the efficiency and interpretability of decision trees, private decision tree evaluation (PDTE) has garnered significant attention. However, existing PDTE schemes suffer from significant limitations: their communication and computation costs scale with the number of trees, the number of nodes, or the tree depth, which makes them inefficient for large-scale models, especially over WAN networks. To address these issues, we propose Kangaroo, a private and amortized decision tree inference framework build upon packed homomorphic encryption. Specifically, we design a novel model hiding and encoding scheme, together with secure feature selection, oblivious comparison, and secure path evaluation protocols, enabling full amortization of the overhead as the number of nodes or trees scales. Furthermore, we enhance the performance and functionality of the framework through optimizations, including same-sharing-for-same-model, latency-aware, and adaptive encoding adjustment strategies. Kangaroo achieves a to performance improvement over state-of-the-art (SOTA) one-round interactive schemes in WAN environments. For large-scale decision tree inference tasks, it delivers a to speedup compared to existing schemes. Notably, Kangaroo enables the evaluation of a random forest with trees and nodes in approximately ms per tree (amortized) under WAN environments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6da6d727-b2fb-4910-bd32-b2dadafd6f04Builds on19
- GAZELLE: A Low Latency Framework for Secure Neural Network InferenceChiraag Juvekar, Vinod Vaikuntanathan, Anantha P. ChandrakasanUSENIX Security 2018 · 1,075 citations
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 898 citations
- Oblivious Neural Network Predictions via MiniONN TransformationsJian Liu, Mika Juuti, Yao Lu, N. AsokanCCS 2017 · 800 citations
- High-Throughput Semi-Honest Secure Three-Party Computation with an Honest MajorityToshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof et al.CCS 2016 · 463 citations
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 404 citations
Related papers
- Low-Complexity Private Decision Tree Evaluation over Homomorphic EncryptionDongjin Park, Gyeongwon Cha, Joon-Woo LeeCCS 2026
- Level Up: Private Non-Interactive Decision Tree Evaluation using Levelled Homomorphic EncryptionRasoul Akhavan Mahdavi, Haoyan Ni, Dimitry Linkov, Florian KerschbaumCCS 2023 · 8 citations
- Vectorized secure evaluation of decision forestsRaghav Malik, Vidush Singhal, Benjamin Gottfried, Milind KulkarniPLDI 2021 · 7 citations
- SortingHat: Efficient Private Decision Tree Evaluation via Homomorphic Encryption and TranscipheringKelong Cong, Debajyoti Das, Jeongeun Park, Hilder V. L. PereiraCCS 2022 · 43 citations
- PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic EncryptionWen-jie Lu, Zhicong Huang, Cheng Hong, Yiping Ma et al.S&P 2021 · 139 citations
