{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:59:12Z","timestamp":1773511152009,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Ministry of Business, Innovation and Employment (MBIE), New Zealand","award":["STRATUS (UOWX1503)"],"award-info":[{"award-number":["STRATUS (UOWX1503)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,12,4]]},"DOI":"10.1145\/3627106.3627131","type":"proceedings-article","created":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T18:13:22Z","timestamp":1701540802000},"page":"799-813","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Mostree: Malicious Secure Private Decision Tree Evaluation with Sublinear Communication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6468-629X","authenticated-orcid":false,"given":"Jianli","family":"Bai","sequence":"first","affiliation":[{"name":"University of Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9927-0534","authenticated-orcid":false,"given":"Xiangfu","family":"Song","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4840-5520","authenticated-orcid":false,"given":"Xiaowu","family":"Zhang","sequence":"additional","affiliation":[{"name":"CloudWalk Technology, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5304-7975","authenticated-orcid":false,"given":"Qifan","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Auckland, New Zealand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8124-6800","authenticated-orcid":false,"given":"Shujie","family":"Cui","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4613-0866","authenticated-orcid":false,"given":"Ee-Chien","family":"Chang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6987-0803","authenticated-orcid":false,"given":"Giovanni","family":"Russello","sequence":"additional","affiliation":[{"name":"University of Auckland, New Zealand"}]}],"member":"320","published-online":{"date-parts":[[2023,12,4]]},"reference":[{"key":"e_1_3_2_1_1_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 ACM CCS. 805\u2013817.","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell Thomas Schneider and Michael Zohner. 2013. More efficient oblivious transfer and extensions for faster secure computation. In ACM CCS. 535\u2013548.","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Nuttapong Attrapadung Goichiro Hanaoaka Takahiro Matsuda Hiraku Morita Kazuma Ohara Jacob\u00a0CN Schuldt Tadanori Teruya and Kazunari Tozawa. 2021. Oblivious Linear Group Actions and Applications. In ACM CCS. 630\u2013650.","DOI":"10.1145\/3460120.3484584"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Jianli Bai Xiangfu Song Shujie Cui Ee-Chien Chang and Giovanni Russello. 2022. Scalable Private Decision Tree Evaluation with Sublinear Communication. In AsiaCCS. 843\u2013857.","DOI":"10.1145\/3488932.3517413"},{"key":"e_1_3_2_1_5_1","volume-title":"Secure evaluation of private linear branching programs with medical applications","author":"Barni Mauro","unstructured":"Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov, Riccardo Lazzeretti, Ahmad-Reza Sadeghi, and Thomas Schneider. 2009. Secure evaluation of private linear branching programs with medical applications. In ESORICS. Springer, 424\u2013439."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Raphael Bost Raluca\u00a0Ada Popa Stephen Tu and Shafi Goldwasser. 2015. Machine learning classification over encrypted data. In NDSS Vol.\u00a04324. 4325.","DOI":"10.14722\/ndss.2015.23241"},{"key":"e_1_3_2_1_7_1","volume-title":"Function secret sharing","author":"Boyle Elette","unstructured":"Elette Boyle, Niv Gilboa, and Yuval Ishai. 2015. Function secret sharing. In EUROCRYPTO. Springer, 337\u2013367."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function secret sharing: Improvements and extensions. In AMC CCS. 1292\u20131303.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_1_9_1","volume-title":"Secure computation with preprocessing via function secret sharing","author":"Boyle Elette","unstructured":"Elette Boyle, Niv Gilboa, and Yuval Ishai. 2019. Secure computation with preprocessing via function secret sharing. In TCC. Springer, 341\u2013371."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248644"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Justin Brickell Donald\u00a0E Porter Vitaly Shmatikov and Emmett Witchel. 2007. Privacy-preserving remote diagnostics. In ACM CCS. 498\u2013507.","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_12_1","unstructured":"Jason Catlett. 1991. Overprvning Large Decision Trees.. In IJCAI. Citeseer 764\u2013769."},{"key":"e_1_3_2_1_13_1","volume-title":"Fast large-scale honest-majority MPC for malicious adversaries","author":"Chida Koji","unstructured":"Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, and Ariel Nof. 2018. Fast large-scale honest-majority MPC for malicious adversaries. In CRYPTO. Springer, 34\u201364."},{"key":"e_1_3_2_1_14_1","volume-title":"New primitives for actively-secure MPC over rings with applications to private machine learning","author":"Damg\u00e5rd Ivan","unstructured":"Ivan Damg\u00e5rd, Daniel Escudero, Tore Frederiksen, Marcel Keller, Peter Scholl, and Nikolaj Volgushev. 2019. New primitives for actively-secure MPC over rings with applications to private machine learning. In IEEE S&P. IEEE, 1102\u20131120."},{"key":"e_1_3_2_1_15_1","volume-title":"Waldo: A private time-series database from function secret sharing","author":"Dauterman Emma","year":"2022","unstructured":"Emma Dauterman, Mayank Rathee, Raluca\u00a0Ada Popa, and Ion Stoica. 2022. Waldo: A private time-series database from function secret sharing. In IEEE S&P. IEEE, 2450\u20132468."},{"key":"e_1_3_2_1_16_1","volume-title":"Maliciously Secure Verifiable Function Secret Sharing","author":"de Castro Leo","unstructured":"Leo de Castro and Anitgoni Polychroniadou. 2022. Lightweight, Maliciously Secure Verifiable Function Secret Sharing. In EUROCRYPT. Springer, 150\u2013179."},{"key":"e_1_3_2_1_17_1","first-page":"217","article-title":"Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation","volume":"16","author":"De\u00a0Cock Martine","year":"2017","unstructured":"Martine De\u00a0Cock, Rafael Dowsley, Caleb Horst, Raj Katti, Anderson\u00a0CA Nascimento, Wing-Sea Poon, and Stacey Truex. 2017. Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation. IEEE TDSC 16, 2 (2017), 217\u2013230.","journal-title":"IEEE TDSC"},{"key":"e_1_3_2_1_18_1","volume-title":"High-throughput secure three-party computation for malicious adversaries and an honest majority","author":"Furukawa Jun","unstructured":"Jun Furukawa, Yehuda Lindell, Ariel Nof, and Or Weinstein. 2017. High-throughput secure three-party computation for malicious adversaries and an honest majority. In EUROCRYPT. Springer, 225\u2013255."},{"key":"e_1_3_2_1_19_1","volume-title":"Distributed point functions and their applications","author":"Gilboa Niv","unstructured":"Niv Gilboa and Yuval Ishai. 2014. Distributed point functions and their applications. In EUROCRYPT. Springer, 640\u2013658."},{"key":"e_1_3_2_1_20_1","volume-title":"MACAO: A maliciously-secure and client-efficient active ORAM framework. Cryptology ePrint Archive","author":"Hoang Thang","year":"2020","unstructured":"Thang Hoang, Jorge Guajardo, and Attila\u00a0A Yavuz. 2020. MACAO: A maliciously-secure and client-efficient active ORAM framework. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_21_1","volume-title":"Extending oblivious transfers efficiently","author":"Ishai Yuval","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending oblivious transfers efficiently. In CRYPTO. Springer, 145\u2013161."},{"key":"e_1_3_2_1_22_1","volume-title":"Evaluating branching programs on encrypted data","author":"Ishai Yuval","unstructured":"Yuval Ishai and Anat Paskin. 2007. Evaluating branching programs on encrypted data. In TCC. Springer, 575\u2013594."},{"key":"e_1_3_2_1_23_1","volume-title":"UC Secure Private Branching Program and Decision Tree Evaluation. Cryptology ePrint Archive","author":"Ji Keyu","year":"2021","unstructured":"Keyu Ji, Bingsheng Zhang, Tianpei Lu, Lichun Li, and Kui Ren. 2021. UC Secure Private Branching Program and Decision Tree Evaluation. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_24_1","volume-title":"IFIP DBSec","author":"Joye Marc","unstructured":"Marc Joye and Fariborz Salehi. 2018. Private yet efficient decision tree evaluation. In IFIP DBSec. Springer, 243\u2013259."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0026"},{"key":"e_1_3_2_1_26_1","first-page":"96","article-title":"A two-step method to construct credit scoring models with data mining techniques","volume":"1","author":"Koh Hian\u00a0Chye","year":"2006","unstructured":"Hian\u00a0Chye Koh, Wei\u00a0Chin Tan, and Chwee\u00a0Peng Goh. 2006. A two-step method to construct credit scoring models with data mining techniques. International Journal of Business and Information 1, 1 (2006), 96\u2013118.","journal-title":"International Journal of Business and Information"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9272-4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3345661"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Ariel Nof. 2017. A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In ACM CCS. 259\u2013276.","DOI":"10.1145\/3133956.3133999"},{"key":"e_1_3_2_1_30_1","unstructured":"Jack\u00a0PK Ma Raymond\u00a0KH Tai Yongjun Zhao and Sherman\u00a0SM Chow. 2021. Let\u2019s stride blindfolded in a forest: Sublinear multi-client decision trees evaluation. In NDSS."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A mixed protocol framework for machine learning. In ACM CCS. 35\u201352.","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_2_1_32_1","volume-title":"PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries with Full Security. Cryptology ePrint Archive","author":"Mouris Dimitris","year":"2023","unstructured":"Dimitris Mouris, Pratik Sarkar, and Nektarios\u00a0Georgios Tsoutsos. 2023. PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries with Full Security. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016409317640"},{"key":"e_1_3_2_1_34_1","unstructured":"Peter Rindal. [n. d.]. The ABY3 Framework for Machine Learning and Database Operations.https:\/\/github.com\/ladnir\/aby3."},{"key":"e_1_3_2_1_35_1","volume-title":"Privacy-preserving decision trees evaluation via linear functions","author":"Tai KH","unstructured":"Raymond\u00a0KH Tai, Jack\u00a0PK Ma, Yongjun Zhao, and Sherman\u00a0SM Chow. 2017. Privacy-preserving decision trees evaluation via linear functions. In ESORICS. Springer, 494\u2013512."},{"key":"e_1_3_2_1_36_1","volume-title":"Private Evaluation of Decision Trees using Sublinear Cost.PoPETs","author":"Tueno Anselme","year":"2019","unstructured":"Anselme Tueno, Florian Kerschbaum, and Stefan Katzenbeisser. 2019. Private Evaluation of Decision Trees using Sublinear Cost.PoPETs 2019, 1 (2019), 266\u2013286."},{"key":"e_1_3_2_1_37_1","volume-title":"Duoram: A Bandwidth-Efficient Distributed ORAM for 2-and 3-Party Computation. Cryptology ePrint Archive","author":"Vadapalli Adithya","year":"2022","unstructured":"Adithya Vadapalli, Ryan Henry, and Ian Goldberg. 2022. Duoram: A Bandwidth-Efficient Distributed ORAM for 2-and 3-Party Computation. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_1_38_1","volume-title":"Pika: Secure Computation using Function Secret Sharing over Rings. Cryptology ePrint Archive","author":"Wagh Sameer","year":"2022","unstructured":"Sameer Wagh. 2022. Pika: Secure Computation using Function Secret Sharing over Rings. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_1_39_1","volume-title":"Privately Evaluating Decision Trees and Random Forests.PoPETs","author":"Wu J","year":"2016","unstructured":"David\u00a0J Wu, Tony Feng, Michael Naehrig, and Kristin\u00a0E Lauter. 2016. Privately Evaluating Decision Trees and Random Forests.PoPETs 2016, 4 (2016), 335\u2013355."}],"event":{"name":"ACSAC '23: Annual Computer Security Applications Conference","location":"Austin TX USA","acronym":"ACSAC '23"},"container-title":["Annual Computer Security Applications Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627106.3627131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627106.3627131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T17:39:07Z","timestamp":1755884347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627106.3627131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,4]]},"references-count":39,"alternative-id":["10.1145\/3627106.3627131","10.1145\/3627106"],"URL":"https:\/\/doi.org\/10.1145\/3627106.3627131","relation":{},"subject":[],"published":{"date-parts":[[2023,12,4]]},"assertion":[{"value":"2023-12-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}