Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring

Tsuchida, Hikaru; Nishide, Takashi; Maeda, Yusaku

doi:10.1007/978-3-030-62576-4_15

Cited by 4 publications

(15 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing private decision tree evaluation (PDTE) protocols rely on homomorphic encryption (HE) and garbled circuits (GC) [6,11,44,47,50], secret sharing (SS) schemes [27,36,46] or a combination of these primitives. The best choice depends on the environment because these primitives often have a trade-off regarding the required computation cost, communication cost, the targeted computed circuit size and scalability of the threat models.…”

Section: Related Workmentioning

confidence: 99%

“…As opposed to the above approach, another line of research has proposed PDTE protocols [27,28,36,46] based on secret-sharing (SS) schemes. The advantage of SS-based protocols is their low computational cost and low communication volume, compared to HE-based and GC-based protocols, which generally require heavy computations.…”

Section: Related Workmentioning

confidence: 99%

“…Recently, several SS-based constant-round PDTE protocols have been proposed. Tsuchida et al [46] have performed a significant improvement in this line of research by proposing the first constant communication round (25 rounds) PDTE protocol, where the number of rounds is independent of the height of the tree model. Their proposed protocol is defined over a residue ring (contrary to all previous works relying on finite fields) providing important improvements in computation and communication cost while relying on a secret sharing scheme and three-party computation.…”

Section: Related Workmentioning

confidence: 99%

“…In this paper, we investigate the question of whether it is possible to further improve the performance of a constant communication round PDTE protocol that relies on secret sharing and is defined over a residue ring. In particular, we aim to improve the communication complexity and computational cost compared to the SS-based schemes of Tsuchida et al [46] and Ji et al [28].…”

Section: Related Workmentioning

confidence: 99%

“…For instance, there have been many privacy-preserving protocols for basic operations such as less-than/equality check [14,18,20,40,41], division [8,26,39], shuffle [15], and database join [34], just to name a few. Among this line of work, [20,40,41] provided a constant-round less-than protocol over a field and [46] provided a constant-round less-than protocol over a ring. These works have shown that MPC can run at practical speeds since the main overhead of secret-sharing-based MPC arises from the communication delay depending on the number of communication rounds in many cases.…”

Section: Introduction 1backgroundmentioning

confidence: 99%

See 4 more Smart Citations

Constant-Round Private Decision Tree Evaluation for Secret Shared Data

Cheng,

Gupta,

Mitrokotsa

et al. 2024

PoPETs

View full text Add to dashboard Cite

Decision tree evaluation is extensively used in machine learning to construct accurate classification models. Often in the cloud-assisted communication paradigm cloud servers execute remote evaluations of classification models using clients' data. In this setting, the need for private decision tree evaluation (PDTE) has emerged to guarantee no leakage of information for the client's input nor the service provider's trained model i.e., decision tree. In this paper, we propose a private decision tree evaluation protocol based on the three-party replicated secret sharing (RSS) scheme. This enables us to securely classify inputs without any leakage of the provided input or the trained decision tree model. Our protocol only requires constant rounds of communication among servers, which is useful in a network with longer delays.Ma et al. (NDSS 2021) presented a lightweight PDTE protocol with sublinear communication cost with linear round complexity in the size of the input data. This protocol works well in the low latency network such as LAN while its total execution time is unfavourably increased in the WAN setting. In contrast, Tsuchida et al. (ProvSec 2020) constructed a constant round PDTE protocol at the cost of communication complexity, which works well in the WAN setting. Although their construction still requires 25 rounds, it showed a possible direction on how to make constant round PDTE protocols. Ji et al. (IEEE Transactions on Dependable and Secure Computing) presented a simplified PDTE with constant rounds using the function secret sharing (FSS) at the cost of communication complexity. Our proposed protocol only requires five rounds among the employed three servers executing secret sharing schemes, which is comparable to previously proposed protocols that are based on garbled circuits and homomorphic encryption. To further demonstrate the efficiency of our protocol, we evaluated it using real-world classification datasets. The evaluation results indicate that our protocol provides better concrete performance in the WAN setting that has a large network delay.

show abstract