{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,3]],"date-time":"2026-09-03T15:08:53Z","timestamp":1788448133954,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670268","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4673-4687","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Securely Training Decision Trees Efficiently"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7742-1313","authenticated-orcid":false,"given":"Divyanshu","family":"Bhardwaj","sequence":"first","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6244-4563","authenticated-orcid":false,"given":"Sandhya","family":"Saravanan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-9768","authenticated-orcid":false,"given":"Nishanth","family":"Chandran","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5255-350X","authenticated-orcid":false,"given":"Divya","family":"Gupta","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. MP-SPDZ: Versatile framework for multi-party computation. https:\/\/github.com\/data61\/MP-SPDZ."},{"key":"e_1_3_2_1_2_1","unstructured":"2023. Decision Tree. https:\/\/github.com\/data61\/MP-SPDZ\/blob\/master\/Compiler\/decision_tree.py."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Mark Abspoel Daniel Escudero and Nikolaj Volgushev. 2021. Secure training of decision trees with continuous attributes. In PoPETS.","DOI":"10.2478\/popets-2021-0010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Adi Akavia Max Leibovich Yehezkel S. Resheff Roey Ron Moni Shahar and Margarita Vald. 2022. Privacy-Preserving Decision Trees Training and Prediction. In ECML-PKDD.","DOI":"10.1007\/978-3-030-67658-2_9"},{"key":"e_1_3_2_1_5_1","volume-title":"Level Up: Private Non-Interactive Decision Tree Evaluation using Levelled Homomorphic Encryption. In CCS.","author":"Mahdavi Rasoul Akhavan","year":"2023","unstructured":"Rasoul Akhavan Mahdavi, Haoyan Ni, Dimitry Linkov, and Florian Kerschbaum. 2023. Level Up: Private Non-Interactive Decision Tree Evaluation using Levelled Homomorphic Encryption. In CCS."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Toshinori Araki Jun Furukawa Yehuda Lindell Ariel Nof and Kazuma Ohara. 2016. High-throughput semi-honest secure three-party computation with an honest majority. In CCS.","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Toshinori Araki Jun Furukawa Kazuma Ohara Benny Pinkas Hanan Rosemarin and Hikaru Tsuchida. 2021. Secure Graph Analysis at Scale. In CCS.","DOI":"10.1145\/3460120.3484560"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Koki Hamada Dai Ikarashi Ryo Kikuchi Ariel Nof Benny Pinkas Katsumi Takahashi and Junichi Tomida. 2022. Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. In CCS.","DOI":"10.1145\/3548606.3560691"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In STOC.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov Sven Laur and Riivo Talviste. 2014. A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation. In NordSec.","DOI":"10.1007\/978-3-319-11599-3_4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Justin Brickell Donald E. Porter Vitaly Shmatikov and Emmett Witchel. 2007. Privacy-preserving remote diagnostics. In CCS.","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In FOCS.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Nan Cheng Naman Gupta Aikaterini Mitrokotsa Hiraku Morita and Kazunari Tozawa. 2024. Constant-Round Private Decision Tree Evaluation for Secret Shared Data. In PoPETS.","DOI":"10.56553\/popets-2024-0023"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Sebastiaan de Hoogh Berry Schoenmakers Ping Chen and Harm op den Akker. 2014. Practical Secure Decision Tree Learning in a Teletreatment Application. In FCDS.","DOI":"10.1007\/978-3-662-45472-5_12"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In STOC.","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_17_1","volume-title":"Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization. In CCS.","author":"Ruisheng Zhou Lushan Song Wenqiang Ruan","year":"2024","unstructured":"Wenqiang Ruan Ruisheng Zhou Lushan Song Bingshuai Li Yunfeng Shao Guopeng Lin, Weili Han. 2024. Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization. In CCS."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Koki Hamada Dai Ikarashi Ryo Kikuchi and Koji Chida. 2023. Efficient decision tree training with new data structure for secure multi-party computation. In PoPETS.","DOI":"10.56553\/popets-2023-0021"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Koki Hamada Ryo Kikuchi Dai Ikarashi Koji Chida and Katsumi Takahashi. 2013. Practically efficient multi-party sorting protocols from comparison sort algorithms. In ICISC.","DOI":"10.1007\/978-3-642-37682-5_15"},{"key":"e_1_3_2_1_20_1","unstructured":"Mitsuru Ito Akira Saito and Takao Nishizeki. 1989. Secret sharing scheme realizing general access structure. In Electronics and Communications in Japan."},{"key":"e_1_3_2_1_21_1","volume-title":"UC Secure Private Branching Program and Decision Tree Evaluation","author":"Ji Keyu","unstructured":"Keyu Ji, Bingsheng Zhang, Tianpei Lu, Lichun Li, and Kui Ren. 2023. UC Secure Private Branching Program and Decision Tree Evaluation. In IEEE DSC."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Sven Laur Jan Willemson and Bingsheng Zhang. 2011. Round-Efficient Oblivious Database Manipulation. In ISC.","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell. 2017. How to Simulate It -- A Tutorial on the Simulation Proof Technique. In Tutorials on the Foundations of Cryptography.","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Benny Pinkas. 2000. Privacy Preserving Data Mining. In CRYPTO.","DOI":"10.1007\/3-540-44598-6_3"},{"key":"e_1_3_2_1_26_1","unstructured":"Wen-jie Lu Zhicong Huang Qizhi Zhang Yuchen Wang and Cheng Hong. 2023. Squirrel: a scalable secure two-party computation framework for training gradient boosting decision tree. In USENIX."},{"key":"e_1_3_2_1_27_1","unstructured":"Jack Ma Raymond Tai Yongjun Zhao and Sherman Chow. 2020. Let's Stride Blindfolded in a Forest: Sublinear Multi-Client Decision Trees Evaluation. In NDSS."},{"key":"e_1_3_2_1_28_1","unstructured":"Qingkai Ma and Ping Deng. 2008. Secure Multi-party Protocols for Privacy Preserving Data Mining. In WASA."},{"key":"e_1_3_2_1_29_1","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In CCS."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Saeed Samet and Ali Miri. 2008. Privacy preserving ID3 using Gini Index over horizontally partitioned data. In AICCSA.","DOI":"10.1109\/AICCSA.2008.4493598"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Adi Shamir. 1979. How to Share a Secret. In Communication of ACM.","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_32_1","unstructured":"Raymond Tai Jack Ma Yongjun Zhao and Sherman Chow. 2017. Privacy-Preserving Decision Trees Evaluation via Linear Functions. In ESORICS."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Hikaru Tsuchida Takashi Nishide and Yusaku Maeda. 2020. Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring. In ProvSec.","DOI":"10.1007\/978-3-030-62576-4_15"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Jaideep Vaidya Chris Clifton Murat Kantarcioglu and A. Scott Patterson. 2005. Privacy-preserving decision trees over vertically partitioned data. In DBSec.","DOI":"10.1007\/11535706_11"},{"key":"e_1_3_2_1_35_1","volume-title":"Yu","author":"Wang Ke","year":"2006","unstructured":"Ke Wang, Yabo Xu, Rong She, and Philip S. Yu. 2006. Classification Spanning Private Databases. In AAAI."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"David Wu Tony Feng Michael Naehrig and Kristin Lauter. 2016. Privately Evaluating Decision Trees and Random Forests. In PoPETS.","DOI":"10.1515\/popets-2016-0043"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Ming-Jun Xiao Liu-Sheng Huang Yong-Long Luo and Hong Shen. 2005. Privacy Preserving ID3 Algorithm over Horizontally Partitioned Data. In PDCAT.","DOI":"10.1109\/PDCAT.2005.191"},{"key":"e_1_3_2_1_38_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In FOCS."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:12:06Z","timestamp":1755843126000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":38,"alternative-id":["10.1145\/3658644.3670268","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670268","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}