Table of Contents
Fetching ...

Silent Guardians: Independent and Secure Decision Tree Evaluation Without Chatter

Jinyuan Li, Liang Feng Zhang

Abstract

As machine learning as a service (MLaaS) gains increasing popularity, it raises two critical challenges: privacy and verifiability. For privacy, clients are reluctant to disclose sensitive private information to access MLaaS, while model providers must safeguard their proprietary models. For verifiability, clients lack reliable mechanisms to ensure that cloud servers execute model inference correctly. Decision trees are widely adopted in MLaaS due to their popularity, interpretability, and broad applicability in domains like medicine and finance. In this context, outsourcing decision tree evaluation (ODTE) enables both clients and model providers to offload their sensitive data and decision tree models to the cloud securely. However, existing ODTE schemes often fail to address both privacy and verifiability simultaneously. To bridge this gap, we propose $\sf PVODTE$, a novel two-server private and verifiable ODTE protocol that leverages homomorphic secret sharing and a MAC-based verification mechanism. $\sf PVODTE$ eliminates the need for server-to-server communication, enabling independent computation by each cloud server. This ``non-interactive'' setting addresses the latency and synchronization bottlenecks of prior arts, making it uniquely suitable for wide-area network (WAN) deployments. To our knowledge, $\sf PVODTE$ is the first two-server ODTE protocol that eliminates server-to-server communication. Furthermore, $\sf PVODTE$ achieves security against \emph{malicious} servers, where servers cannot learn anything about the client's input or the providers' decision tree models, and servers cannot alter the inference result without being detected.

Silent Guardians: Independent and Secure Decision Tree Evaluation Without Chatter

Abstract

As machine learning as a service (MLaaS) gains increasing popularity, it raises two critical challenges: privacy and verifiability. For privacy, clients are reluctant to disclose sensitive private information to access MLaaS, while model providers must safeguard their proprietary models. For verifiability, clients lack reliable mechanisms to ensure that cloud servers execute model inference correctly. Decision trees are widely adopted in MLaaS due to their popularity, interpretability, and broad applicability in domains like medicine and finance. In this context, outsourcing decision tree evaluation (ODTE) enables both clients and model providers to offload their sensitive data and decision tree models to the cloud securely. However, existing ODTE schemes often fail to address both privacy and verifiability simultaneously. To bridge this gap, we propose , a novel two-server private and verifiable ODTE protocol that leverages homomorphic secret sharing and a MAC-based verification mechanism. eliminates the need for server-to-server communication, enabling independent computation by each cloud server. This ``non-interactive'' setting addresses the latency and synchronization bottlenecks of prior arts, making it uniquely suitable for wide-area network (WAN) deployments. To our knowledge, is the first two-server ODTE protocol that eliminates server-to-server communication. Furthermore, achieves security against \emph{malicious} servers, where servers cannot learn anything about the client's input or the providers' decision tree models, and servers cannot alter the inference result without being detected.

Paper Structure

This paper contains 36 sections, 2 theorems, 14 equations, 4 figures, 7 tables, 6 algorithms.

Key Result

Theorem 1

Our protocol securely computes the ideal functionality $f^{\text{\em ODTE}}$ in the presence of semi-honest adversaries.

Figures (4)

  • Figure 1: A decision tree of height 2 ($m=3,k=4$)
  • Figure 2: Our ODTE System Framework
  • Figure 3: Comparison of overall online communication overhead of $\sf ODTE_{SS}$zheng2022, $\sf ODTE_{OS}$zheng2023 and our $\sf PVODTE_{MS}$. The y-axis is in logarithmic scale.
  • Figure 4: Online running time in different WAN settings for different databases. $y$-axis is in the logarithm scale.

Theorems & Definitions (6)

  • Definition 1: Semi-Honest Security
  • Theorem 1
  • proof
  • Definition 2: Malicious Security against Servers
  • Theorem 2
  • proof