Secure Two-Party Decision Tree Classification Based on Function Secret Sharing
Decision tree models are widely used for classification tasks in data mining. However, privacy becomes a significant concern when training data contain sensitive information from different parties. This paper proposes a novel framework for secure two-party decision tree classification that enables c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2023/5302915 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546824731230208 |
|---|---|
| author | Kun Liu Chunming Tang |
| author_facet | Kun Liu Chunming Tang |
| author_sort | Kun Liu |
| collection | DOAJ |
| description | Decision tree models are widely used for classification tasks in data mining. However, privacy becomes a significant concern when training data contain sensitive information from different parties. This paper proposes a novel framework for secure two-party decision tree classification that enables collaborative training and evaluation without leaking sensitive data. The critical techniques employed include homomorphic encryption, function secret sharing (FSS), and a custom secure comparison protocol. Homomorphic encryption allows computations on ciphertexts, enabling parties to evaluate an encrypted decision tree model jointly. FSS splits functions into secret shares to hide sensitive intermediate values. The comparison protocol leverages FSS to securely compare attribute values to node thresholds for tree traversal, reducing overhead through efficient cryptographic techniques. Our framework divides computation between two servers holding private data. A privacy-preserving protocol lets them jointly construct a decision tree classifier without revealing their respective inputs. The servers encrypt their data and exchange function secret shares to traverse the tree and obtain the classification result. Rigorous security proofs demonstrate that the protocol protects data confidentiality in a semihonest model. Experiments on benchmark datasets confirm that the approach achieves high accuracy with reasonable computation and communication costs. The techniques minimize accuracy loss and latency compared to prior protocols. Overall, the paper delivers an efficient, modular framework for practical two-party secure decision tree evaluation that advances the capability of privacy-preserving machine learning. |
| format | Article |
| id | doaj-art-9e660fa2d8dc4e4db1b0cceb357d31fe |
| institution | Kabale University |
| issn | 1099-0526 |
| language | English |
| publishDate | 2023-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-9e660fa2d8dc4e4db1b0cceb357d31fe2025-02-03T06:47:14ZengWileyComplexity1099-05262023-01-01202310.1155/2023/5302915Secure Two-Party Decision Tree Classification Based on Function Secret SharingKun Liu0Chunming Tang1School of Mathematics and Information SciencesSchool of Mathematics and Information SciencesDecision tree models are widely used for classification tasks in data mining. However, privacy becomes a significant concern when training data contain sensitive information from different parties. This paper proposes a novel framework for secure two-party decision tree classification that enables collaborative training and evaluation without leaking sensitive data. The critical techniques employed include homomorphic encryption, function secret sharing (FSS), and a custom secure comparison protocol. Homomorphic encryption allows computations on ciphertexts, enabling parties to evaluate an encrypted decision tree model jointly. FSS splits functions into secret shares to hide sensitive intermediate values. The comparison protocol leverages FSS to securely compare attribute values to node thresholds for tree traversal, reducing overhead through efficient cryptographic techniques. Our framework divides computation between two servers holding private data. A privacy-preserving protocol lets them jointly construct a decision tree classifier without revealing their respective inputs. The servers encrypt their data and exchange function secret shares to traverse the tree and obtain the classification result. Rigorous security proofs demonstrate that the protocol protects data confidentiality in a semihonest model. Experiments on benchmark datasets confirm that the approach achieves high accuracy with reasonable computation and communication costs. The techniques minimize accuracy loss and latency compared to prior protocols. Overall, the paper delivers an efficient, modular framework for practical two-party secure decision tree evaluation that advances the capability of privacy-preserving machine learning.http://dx.doi.org/10.1155/2023/5302915 |
| spellingShingle | Kun Liu Chunming Tang Secure Two-Party Decision Tree Classification Based on Function Secret Sharing Complexity |
| title | Secure Two-Party Decision Tree Classification Based on Function Secret Sharing |
| title_full | Secure Two-Party Decision Tree Classification Based on Function Secret Sharing |
| title_fullStr | Secure Two-Party Decision Tree Classification Based on Function Secret Sharing |
| title_full_unstemmed | Secure Two-Party Decision Tree Classification Based on Function Secret Sharing |
| title_short | Secure Two-Party Decision Tree Classification Based on Function Secret Sharing |
| title_sort | secure two party decision tree classification based on function secret sharing |
| url | http://dx.doi.org/10.1155/2023/5302915 |
| work_keys_str_mv | AT kunliu securetwopartydecisiontreeclassificationbasedonfunctionsecretsharing AT chunmingtang securetwopartydecisiontreeclassificationbasedonfunctionsecretsharing |