{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T03:31:53Z","timestamp":1768015913632,"version":"3.49.0"},"reference-count":59,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171114"],"award-info":[{"award-number":["12171114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2023,10,31]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1155\/2023\/5302915","type":"journal-article","created":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T01:35:08Z","timestamp":1698802508000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Secure Two-Party Decision Tree Classification Based on Function Secret Sharing"],"prefix":"10.1155","volume":"2023","author":[{"given":"Kun","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Sciences, Guangzhou University, Guangzhou 510000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7634-4705","authenticated-orcid":true,"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Sciences, Guangzhou University, Guangzhou 510000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"2","key":"1","article-title":"Data mining: practical machine learning tools and techniques","volume":"54","author":"H. W. Ian","year":"2011","journal-title":"Annals of Physics"},{"key":"2","first-page":"1322","article-title":"Model inversion attacks that exploit confidence information and basic countermeasures","author":"M. Fredrikson"},{"key":"3","first-page":"601","article-title":"Stealing machine learning models via prediction apis","author":"F. Trame\u0300r"},{"key":"4","first-page":"355","article-title":"A methodology for formalizing model-inversion attacks","author":"X. Wu"},{"key":"5","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","article-title":"Multiparty computation from threshold homomorphic encryption","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck","author":"R. Cramer","year":"2001"},{"key":"6","volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"O. Goldreich","year":"2009"},{"key":"7","first-page":"160","article-title":"Protocols for secure computations","author":"A. C. Yao"},{"key":"8","first-page":"359","article-title":"Oblivm: a programming framework for secure computation","author":"L. Chang"},{"key":"9","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/978-3-642-54807-9_15","article-title":"Cbmc-gc: an ansi c compiler for secure two-party computations \u00e6","volume-title":"Compiler Construction: 23rd International Conference, CC 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014","author":"M. Franz","year":"2014"},{"key":"10","first-page":"424","article-title":"Secure evaluation of private linear branching programs with medical applications","author":"M. Barni"},{"key":"11","volume-title":"Machine Learning Classification over Encrypted Data","author":"R. Bost","year":"2014"},{"key":"12","first-page":"498","article-title":"Privacy-preserving remote diagnostics","author":"J. Brickell"},{"key":"13","first-page":"243","article-title":"Private yet efficient decision tree evaluation","author":"M. Joye"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0026"},{"key":"15","first-page":"494","article-title":"Privacy-preserving decision trees evaluation via linear functions","author":"R. K. H. Tai"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0015"},{"key":"17","volume-title":"Privately Evaluating Decision Trees and Random Forests","author":"D. J. Wu","year":"2015"},{"key":"18","first-page":"1","article-title":"An access control system using visual cryptography and steganography","author":"G. Bhase"},{"key":"19","first-page":"277","article-title":"Encrypting informative color image using color visual cryptography","author":"P. V. Chavan"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2017.2679189"},{"key":"21","first-page":"67","article-title":"Noninteractive and output expressive private comparison from homomorphic encryption","author":"W.-J. Lu"},{"key":"22","first-page":"2652","article-title":"When homomorphic encryption marries secret sharing: secure large-scale sparse logistic regression and applications in risk control","author":"C. Chen"},{"key":"23","first-page":"19","article-title":"Secureml: a system for scalable privacy-preserving machine learning","author":"P. Mohassel"},{"key":"24","first-page":"707","article-title":"A hybrid secure computation framework for machine learning applications","author":"M. S. Riazi"},{"key":"25","first-page":"171","article-title":"Private evaluation of a decision tree based on secret sharing","volume-title":"International Conference on Information Security and Cryptology","author":"N. A. Mohammad","year":"2022"},{"key":"26","first-page":"1","article-title":"Maldexa-a malware detection system using xgboost on amazon web services","author":"G. Thakur"},{"key":"27","first-page":"337","article-title":"Function secret sharing","author":"E. Boyle"},{"key":"28","first-page":"341","article-title":"Secure computation with pre-processing via function secret sharing","author":"E. Boyle"},{"key":"29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-540-85230-8_7","article-title":"A practical universal circuit construction and secure evaluation of private functions","volume-title":"Financial Cryptography","author":"V. Kolesnikov","year":"2008"},{"key":"30","first-page":"486","article-title":"Actively secure private function evaluation","author":"P. Mohassel"},{"key":"31","first-page":"351","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","volume-title":"Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali","author":"B. Michael","year":"2019"},{"key":"32","first-page":"11","article-title":"Multiparty unconditionally secure protocols","author":"D. Chaum"},{"key":"33","first-page":"830","article-title":"Mascot: faster malicious arithmetic secure computation with oblivious transfer","author":"M. Keller"},{"key":"34","first-page":"643","article-title":"Multiparty computation from somewhat homomorphic encryption","author":"I. Damga\u030ard"},{"key":"35","first-page":"1","article-title":"Practical covertly secure mpc for dishonest majority\u2013or: breaking the spdz limits","author":"I. Damga\u030ard"},{"key":"36","first-page":"416","article-title":"Efficient and secure comparison for on-line auctions","author":"I. Damga\u030ard"},{"key":"37","first-page":"446","article-title":"Commodity-based cryptography","author":"D. Beaver"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"39","volume-title":"Random forests. Ensemble machine learning: methods and applications","author":"A. Cutler","year":"2012"},{"key":"40","first-page":"871","article-title":"Function secret sharing for mixed-mode and fixed-point secure computation","author":"E. Boyle"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0015"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2022.3231784"},{"key":"43","first-page":"162","article-title":"How to generate and exchange secrets","author":"C.-C. Y. Andrew"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"45","first-page":"523","article-title":"Scaling oram for secure computation","author":"J. Doerner"},{"key":"46","first-page":"174","article-title":"Non-interactive private decision tree evaluation","author":"A. Tueno"},{"key":"47","first-page":"31","article-title":"Homomorphic encryption standard","volume-title":"Protecting privacy through homomorphic encryption","author":"M. C. Martin","year":"2021"},{"key":"48","first-page":"3","article-title":"Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds","author":"I. Chillotti"},{"key":"49","first-page":"377","article-title":"Faster packed homomorphic operations and efficient circuit bootstrapping for tfhe","author":"I. Chillotti"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"51","volume-title":"Tfhe: Fast Fully Homomorphic Encryption Library","author":"I. Chillotti","year":"2019"},{"key":"52","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"53","first-page":"1292","article-title":"Function secret sharing: improvements and extensions","author":"E. Boyle"},{"key":"54","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"55","first-page":"496","article-title":"Ezpc: programmable and efficient secure two-party computation for machine learning","author":"N. Chandran"},{"key":"56","article-title":"Openssl. World wide web","author":"E. A. Young","year":"2001"},{"key":"57","first-page":"131","article-title":"On the performance, feasibility, and use of forward-secure signatures","author":"E. Cronin"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0042"},{"key":"59","article-title":"Ariann: low-interaction privacypreserving deep learning via function secret sharing","author":"T. Ryffel","year":"2020"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/5302915.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/5302915.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/5302915.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T01:35:17Z","timestamp":1698802517000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2023\/5302915\/"}},"subtitle":[],"editor":[{"given":"Roberto","family":"Natella","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2023,10,31]]},"references-count":59,"alternative-id":["5302915","5302915"],"URL":"https:\/\/doi.org\/10.1155\/2023\/5302915","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"value":"1099-0526","type":"electronic"},{"value":"1076-2787","type":"print"}],"subject":[],"published":{"date-parts":[[2023,10,31]]}}}