{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:54:14Z","timestamp":1778496854929,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031710728","type":"print"},{"value":"9783031710735","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71073-5_1","type":"book-chapter","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T22:02:12Z","timestamp":1725919332000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Private Decision Tree Evaluation for\u00a0Batched Input from\u00a0Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2636-4406","authenticated-orcid":false,"given":"Kelong","family":"Cong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1093-7978","authenticated-orcid":false,"given":"Jiayi","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3240-9009","authenticated-orcid":false,"given":"Georgio","family":"Nicolas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0557-3540","authenticated-orcid":false,"given":"Jeongeun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Azogagh, S., Delfour, V., Gambs, S., Killijian, M.: PROBONITE: private one-branch-only non-interactive decision tree evaluation. In: Brenner, M., Costache, A., Rohloff, K. (eds.) Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, Los Angeles, CA, USA, 7 November 2022, pp. 23\u201333. ACM (2022). https:\/\/doi.org\/10.1145\/3560827.3563377","DOI":"10.1145\/3560827.3563377"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Bai, J., Song, X., Cui, S., Chang, E.C., Russello, G.: Scalable private decision tree evaluation with sublinear communication. In: Suga, Y., Sakurai, K., Ding, X., Sako, K. (eds.) ASIACCS 2022, pp. 843\u2013857. ACM Press (2022). https:\/\/doi.org\/10.1145\/3488932.3517413","DOI":"10.1145\/3488932.3517413"},{"key":"1_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-031-22966-4_7","volume-title":"ASIACRYPT 2022, Part II","author":"C Bonte","year":"2022","unstructured":"Bonte, C., Iliashenko, I., Park, J., Pereira, H.V.L., Smart, N.P.: FINAL: faster FHE instantiated with NTRU and LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 188\u2013215. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_7"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. In: NDSS\u00a02015. The Internet Society (2015). https:\/\/doi.org\/10.14722\/ndss.2015.23241","DOI":"10.14722\/ndss.2015.23241"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, pp. 498\u2013507. ACM Press (2007). https:\/\/doi.org\/10.1145\/1315245.1315307","DOI":"10.1145\/1315245.1315307"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/S10257-021-00511-W","volume":"19","author":"C Chern","year":"2021","unstructured":"Chern, C., Lei, W., Huang, K., Chen, S.: A decision tree classifier for credit assessment problems in big data environments. Inf. Syst. E Bus. Manag. 19(1), 363\u2013386 (2021). https:\/\/doi.org\/10.1007\/S10257-021-00511-W","journal-title":"Inf. Syst. E Bus. Manag."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.L.: SortingHat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 563\u2013577. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560702","DOI":"10.1145\/3548606.3560702"},{"key":"1_CR12","unstructured":"Cong, K., Geelen, R., Kang, J., Park, J.: Revisiting oblivious top-$$k$$ selection with applications to secure $$k$$-NN classification. Cryptology ePrint Archive, Report 2023\/852 (2023). https:\/\/eprint.iacr.org\/2023\/852"},{"key":"1_CR13","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"1_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"issue":"5","key":"1_CR15","doi-asserted-by":"publisher","first-page":"2624","DOI":"10.3390\/S23052624","volume":"23","author":"Y Hao","year":"2023","unstructured":"Hao, Y., Qin, B., Sun, Y.: Privacy-preserving decision-tree evaluation with low complexity for communication. Sensors 23(5), 2624 (2023). https:\/\/doi.org\/10.3390\/S23052624","journal-title":"Sensors"},{"key":"1_CR16","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. SSS, Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-84858-7"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516668","DOI":"10.1145\/2508859.2516668"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.2478\/popets-2019-0026","journal-title":"PoPETs"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2021.116034","volume":"189","author":"W Liu","year":"2022","unstructured":"Liu, W., Fan, H., Xia, M.: Credit scoring based on tree-enhanced gradient boosting decision trees. Expert Syst. Appl. 189, 116034 (2022). https:\/\/doi.org\/10.1016\/J.ESWA.2021.116034","journal-title":"Expert Syst. Appl."},{"key":"1_CR20","unstructured":"Lu, W., Huang, Z., Zhang, Q., Wang, Y., Hong, C.: Squirrel: a scalable secure two-party computation framework for training gradient boosting decision tree. In: Calandrino, J.A., Troncoso, C. (eds.) 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, 9\u201311 August 2023, pp. 6435\u20136451. USENIX Association (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/lu"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Lu, W., Zhou, J.J., Sakuma, J.: Non-interactive and output expressive private comparison from homomorphic encryption. In: Kim, J., Ahn, G.J., Kim, S., Kim, Y., L\u00f3pez, J., Kim, T. (eds.) ASIACCS 2018, pp. 67\u201374. ACM Press (2018). https:\/\/doi.org\/10.1145\/3196494.3196503","DOI":"10.1145\/3196494.3196503"},{"key":"1_CR22","unstructured":"Mahdavi, R.A., Kerschbaum, F.: Constant-weight PIR: single-round keyword PIR via constant-weight equality operators. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022, pp. 1723\u20131740. USENIX Association (2022)"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Mahdavi, R.A., Ni, H., Linkov, D., Kerschbaum, F.: Level up: private non-interactive decision tree evaluation using levelled homomorphic encryption. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 2945\u20132958. ACM Press (2023). https:\/\/doi.org\/10.1145\/3576915.3623095","DOI":"10.1145\/3576915.3623095"},{"key":"1_CR24","unstructured":"Microsoft SEAL (release 4.1) (2023). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Shi, E., Bethencourt, J., Chan, H.T.H., Song, D.X., Perrig, A.: Multi-dimensional range query over encrypted data. In: 2007 IEEE Symposium on Security and Privacy, pp. 350\u2013364. IEEE Computer Society Press (2007). https:\/\/doi.org\/10.1109\/SP.2007.29","DOI":"10.1109\/SP.2007.29"},{"key":"1_CR26","unstructured":"Shin, H., Choi, J., Lee, D., Kim, K., Lee, Y.: Fully homomorphic training and inference on binary decision tree and random forest. Cryptology ePrint Archive, Report 2024\/529 (2024). https:\/\/eprint.iacr.org\/2024\/529"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. DCC 71(1), 57\u201381 (2014). https:\/\/doi.org\/10.1007\/s10623-012-9720-4","journal-title":"DCC"},{"key":"1_CR28","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":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-49669-2_10","volume-title":"Data and Applications Security and Privacy XXXIV","author":"A Tueno","year":"2020","unstructured":"Tueno, A., Boev, Y., Kerschbaum, F.: Non-interactive private decision tree evaluation. In: Singhal, A., Vaidya, J. (eds.) DBSec 2020. LNCS, vol. 12122, pp. 174\u2013194. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49669-2_10"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.2478\/popets-2019-0015","journal-title":"PoPETs"},{"issue":"4","key":"1_CR31","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1515\/popets-2016-0043","journal-title":"PoPETs"},{"issue":"12","key":"1_CR32","doi-asserted-by":"publisher","first-page":"7838","DOI":"10.1016\/J.ESWA.2010.04.054","volume":"37","author":"D Zhang","year":"2010","unstructured":"Zhang, D., Zhou, X., Leung, S.C.H., Zheng, J.: Vertical bagging decision trees model for credit scoring. Expert Syst. Appl. 37(12), 7838\u20137843 (2010). https:\/\/doi.org\/10.1016\/J.ESWA.2010.04.054","journal-title":"Expert Syst. Appl."},{"key":"1_CR33","unstructured":"Zheng, W., Deng, R., Chen, W., Popa, R.A., Panda, A., Stoica, I.: Cerebro: a platform for multi-party cryptographic collaborative learning. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 2723\u20132740. USENIX Association (2021)"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2478\/popets-2021-0020","volume":"2021","author":"M Zuber","year":"2021","unstructured":"Zuber, M., Sirdey, R.: Efficient homomorphic evaluation of k-NN classifiers. PoPETs 2021(2), 111\u2013129 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0020","journal-title":"PoPETs"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71073-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T22:02:26Z","timestamp":1725919346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71073-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710728","9783031710735"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71073-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"10 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}