{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:04:08Z","timestamp":1743055448475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030905668"},{"type":"electronic","value":"9783030905675"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90567-5_16","type":"book-chapter","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T18:07:39Z","timestamp":1635962859000},"page":"309-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Private Decision Tree Evaluation with\u00a0Constant Rounds via (Only) Fair SS-4PC"],"prefix":"10.1007","author":[{"given":"Hikaru","family":"Tsuchida","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Nishide","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"16_CR1","unstructured":"Acquire valued shoppers challenge\u2014Kaggle. https:\/\/www.kaggle.com\/c\/acquire-valued-shoppers-challenge\/data"},{"key":"16_CR2","unstructured":"Hospital discharge data use agreement. https:\/\/www.dshs.texas.gov\/THCIC\/Hospitals\/Download.shtm"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., Barak, A., Furukawa, J., Keller, M., Ohara, K., Tsuchida, H.: How to choose suitable secure multiparty computation using generalized SPDZ. In: ACM Conference on Computer and Communications Security, pp. 2198\u20132200. ACM (2018)","DOI":"10.1145\/3243734.3278510"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In: IEEE Symposium on Security and Privacy, pp. 843\u2013862. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: ACM Conference on Computer and Communications Security, pp. 805\u2013817. ACM (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-04444-1_26","volume-title":"Computer Security \u2013 ESORICS 2009","author":"M Barni","year":"2009","unstructured":"Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A.-R., Schneider, T.: Secure evaluation of private linear branching programs with medical applications. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 424\u2013439. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04444-1_26"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: ACM Conference on Computer and Communications Security, pp. 498\u2013507. ACM (2007)","DOI":"10.1145\/1315245.1315307"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.2478\/popets-2020-0036","volume":"2020","author":"M Byali","year":"2020","unstructured":"Byali, M., Chaudhari, H., Patra, A., Suresh, A.: FLASH: fast and robust framework for privacy-preserving machine learning. Proc. Priv. Enhancing Technol. 2020(2), 459\u2013480 (2020)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Improved primitives for secure multiparty integer computation. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 182\u2013199. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_13"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Chaudhari, H., Choudhury, A., Patra, A., Suresh, A.: ASTRA: high throughput 3PC over rings with application to secure prediction. In: CCSW@CCS, pp. 81\u201392. ACM (2019)","DOI":"10.1145\/3338466.3358922"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Chaudhari, H., Rachuri, R., Suresh, A.: Trident: efficient 4PC framework for privacy preserving machine learning. In: NDSS. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.23005"},{"key":"16_CR14","unstructured":"Chida, K., Hamada, K., Ikarashi, D., Kikuchi, R., Kiribuchi, N., Pinkas, B.: An efficient secure three-party sorting protocol with an honest majority. IACR Cryptology ePrint Archive 2019:695 (2019)"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TDSC.2017.2679189","volume":"16","author":"MD Cock","year":"2019","unstructured":"Cock, M.D., et al.: Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation. IEEE Trans. Dependable Secur. Comput. 16(2), 217\u2013230 (2019)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Dalskov, A., Escudero, D., Keller, M.: Fantastic four: honest-majority four-party secure computation with malicious security. Cryptology ePrint Archive, Report 2020\/1330 (2020). https:\/\/eprint.iacr.org\/2020\/1330","DOI":"10.2478\/popets-2020-0077"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS. The Internet Society (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOC, pp. 365\u2013377. ACM (1982)","DOI":"10.1145\/800070.802212"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-03332-3_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"SD Gordon","year":"2018","unstructured":"Gordon, S.D., Ranellucci, S., Wang, X.: Secure computation with low communication from cross-checking. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 59\u201385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_3"},{"key":"16_CR22","unstructured":"Hamada, K., Ikarashi, D., Chida, K., Takahashi, K.: Oblivious radix sort: an efficient sorting algorithm for practical secure multi-party computation. IACR Cryptology ePrint Archive 2014:121 (2014)"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-37682-5_15","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"K Hamada","year":"2013","unstructured":"Hamada, K., Kikuchi, R., Ikarashi, D., Chida, K., Takahashi, K.: Practically efficient multi-party sorting protocols from comparison sort algorithms. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 202\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_15"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: ACM Conference on Computer and Communications Security, pp. 451\u2013462. ACM (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"16_CR25","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS. The Internet Society (2012)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-030-21548-4_20","volume-title":"Information Security and Privacy","author":"A Ichikawa","year":"2019","unstructured":"Ichikawa, A., Ogata, W., Hamada, K., Kikuchi, R.: Efficient secure multi-party protocols for decision tree classification. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 362\u2013380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_20"},{"issue":"2","key":"16_CR27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.2478\/popets-2019-0026","volume":"2019","author":"\u00c1 Kiss","year":"2019","unstructured":"Kiss, \u00c1., Naderpour, M., Liu, J., Asokan, N., Schneider, T.: SoK: modular and efficient private decision tree evaluation. PoPETs 2019(2), 187\u2013208 (2019)","journal-title":"PoPETs"},{"key":"16_CR28","unstructured":"Koti, N., Pancholi, M., Patra, A., Suresh, A.: Swift: super-fast and robust privacy-preserving machine learning. Cryptology ePrint Archive, Report 2020\/592 (2020). https:\/\/eprint.iacr.org\/2020\/592"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24861-0_18","volume-title":"Information Security","author":"S Laur","year":"2011","unstructured":"Laur, S., Willemson, J., Zhang, B.: Round-efficient oblivious database manipulation. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 262\u2013277. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24861-0_18"},{"key":"16_CR30","unstructured":"Mohassel, P., Rindal, P.: $${\\rm Aby}^{3}$$: a mixed protocol framework for machine learning. In: ACM Conference on Computer and Communications Security, pp. 35\u201352. ACM (2018)"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-38348-9_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"P Mohassel","year":"2013","unstructured":"Mohassel, P., Sadeghian, S.: How to hide circuits in MPC an efficient framework for private function evaluation. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 557\u2013574. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Patra, A., Suresh, A.: BLAZE: blazing fast privacy-preserving machine learning. In: NDSS. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.24202"},{"issue":"1","key":"16_CR34","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"issue":"8","key":"16_CR35","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136628","volume":"10","author":"VK Singh","year":"2015","unstructured":"Singh, V.K., Bozkaya, B., Pentland, A.: Money walks: implicit mobility behavior and financial well-being. PLoS ONE 10(8), e0136628 (2015)","journal-title":"PLoS ONE"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-319-66399-9_27","volume-title":"Computer Security \u2013 ESORICS 2017","author":"RKH Tai","year":"2017","unstructured":"Tai, R.K.H., Ma, J.P.K., Zhao, Y., Chow, S.S.M.: Privacy-preserving decision trees evaluation via linear functions. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10493, pp. 494\u2013512. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66399-9_27"},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-030-62576-4_15","volume-title":"Provable and Practical Security","author":"H Tsuchida","year":"2020","unstructured":"Tsuchida, H., Nishide, T., Maeda, Y.: Private decision tree evaluation with constant rounds via (only) SS-3PC over ring. In: Nguyen, K., Wu, W., Lam, K.Y., Wang, H. (eds.) ProvSec 2020. LNCS, vol. 12505, pp. 298\u2013317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62576-4_15"},{"issue":"1","key":"16_CR38","doi-asserted-by":"crossref","first-page":"266","DOI":"10.2478\/popets-2019-0015","volume":"2019","author":"A Tueno","year":"2019","unstructured":"Tueno, A., Kerschbaum, F., Katzenbeisser, S.: Private evaluation of decision trees using sublinear cost. PoPETs 2019(1), 266\u2013286 (2019)","journal-title":"PoPETs"},{"issue":"3","key":"16_CR39","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-party secure computation for neural network training. PoPETs 2019(3), 26\u201349 (2019)","journal-title":"PoPETs"},{"issue":"4","key":"16_CR40","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1515\/popets-2016-0043","volume":"2016","author":"DJ Wu","year":"2016","unstructured":"Wu, D.J., Feng, T., Naehrig, M., Lauter, K.E.: Privately evaluating decision trees and random forests. PoPETs 2016(4), 335\u2013355 (2016)","journal-title":"PoPETs"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90567-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T11:53:59Z","timestamp":1673697239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90567-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030905668","9783030905675"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90567-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/data61dsslab.github.io\/acisp2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}