{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:08:49Z","timestamp":1778458129641,"version":"3.51.4"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032200259","type":"print"},{"value":"9783032200266","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-20026-6_3","type":"book-chapter","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:31:33Z","timestamp":1778455893000},"page":"40-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["StrawHat : Private Non-interactive Gradient Boosting Decision Tree Evaluation Based on\u00a0Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9072-6092","authenticated-orcid":false,"given":"El Hadji Mamadou","family":"Dia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4130-0299","authenticated-orcid":false,"given":"Walid","family":"Arabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9758-4617","authenticated-orcid":false,"given":"Anis","family":"Bkakria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7294-5909","authenticated-orcid":false,"given":"Reda","family":"Yaich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"3_CR1","unstructured":"Ke, G., Meng, Q.,et al.: Lightgbm: a highly efficient gradient boosting decision tree, Adv. NeuraL Inf. Process. Syst. 30 (2017)"},{"key":"3_CR2","unstructured":"Feng, J., Yu, Y., Zhou, Z.-H.: Multi-layered gradient boosting decision trees, Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ogunleye, D., Wang, Q.-G.: Xgboost model for chronic kidney disease diagnosis, IEEE\/ACM Trans. Comput. Biol. Bioinform. 17(6), 2131\u20132140 (2019)","DOI":"10.1109\/TCBB.2019.2911071"},{"key":"3_CR4","first-page":"1","volume":"25","author":"P Regulation","year":"2018","unstructured":"Regulation, P.: General data protection regulation. InTouch 25, 1\u20135 (2018)","journal-title":"InTouch"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: a review and open problems, year, In: Proceedings of the 2001 Workshop on New Security Paradigms (2001)","DOI":"10.1145\/508172.508174"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ins.2018.10.024","volume":"476","author":"C Zhao","year":"2019","unstructured":"Zhao, C., et al.: Secure multi-party computation: theory, practice and applications. Inf. Sci. 476, 357\u2013372 (2019)","journal-title":"Inf. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Sabt, M., Achemlal, M., Bouabdallah, A.: Trusted execution environment: what it is, and what it is not, In: 2015 IEEE Trustcom\/BigDataSE\/Ispa, Volume 1. year, IEEE (2015)","DOI":"10.1109\/Trustcom.2015.357"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3517197","volume":"25","author":"A Akavia","year":"2022","unstructured":"Akavia, A., Leibovich, M.: Yehezkel S Resheff, Roey Ron, Moni Shahar, Margarita Vald, Privacy-preserving decision trees training and prediction. ACM Trans. Privacy Secur. 25(3), 1\u201330 (2022)","journal-title":"ACM Trans. Privacy Secur."},{"key":"3_CR9","unstructured":"Mahdavi, R.A., Ni, H., Linkov, D., Kerschbaum, F.: Level up: private non-interactive decision tree evaluation using levelled homomorphic encryption, year, In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (2023)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Azogagh, S., Delfour, V., Gambs, S., Killijian, M.-O.: Probonite: private one-branch-only non-interactive decision tree evaluation, year, In: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (2022)","DOI":"10.1145\/3560827.3563377"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Alex, S.: KJ Dhanaraj. PP Deepthi, Private and energy-efficient decision tree-based disease detection for resource-constrained medical users in mobile healthcare network, IEEE Access 10, 17098\u201317112 (2022)","DOI":"10.1109\/ACCESS.2022.3149771"},{"key":"3_CR12","volume-title":"Raluca Ada Popa","author":"R Bost","year":"2014","unstructured":"Bost, R.: Raluca Ada Popa. Stephen Tu, Shafi Goldwasser, Machine learning classification over encrypted data, Cryptology ePrint Archive (2014)"},{"issue":"4","key":"3_CR13","first-page":"1","volume":"19","author":"C Chen","year":"2025","unstructured":"Chen, C., Wei, L., Xie, J., Shi, Y.: Privacy-preserving machine learning based on cryptography: a survey. ACM Trans. Knowl. Discov. Data 19(4), 1\u201333 (2025)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.L.: Sortinghat: efficient private decision tree evaluation via homomorphic encryption and transciphering, year, In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (2022)","DOI":"10.1145\/3548606.3560702"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Cong, K., Kang, J., Nicolas, G., Park, J.: Faster private decision tree evaluation for batched input from homomorphic encryption, In: International Conference on Security and Cryptography for Networks. year, Springer (2024)","DOI":"10.1007\/978-3-031-71073-5_1"},{"key":"3_CR16","unstructured":"Joye, M., Salehi, F.: Private yet efficient decision tree evaluation, in Data and Applications Security and Privacy XXXII: 32nd Annual IFIP WG 11.3 Conference, DBSec 2018, Bergamo, Italy, July 16\u201318, 2018, Proceedings 32. year, Springer (2018)"},{"key":"3_CR17","unstructured":"Liang, H., Lu, H., Wang, G.: Bpdte: batch private decision tree evaluation via amortized efficient private comparison, Cryptology ePrint Archive (2024)"},{"key":"3_CR18","volume-title":"Guowen Xu","author":"S Yuan","year":"2024","unstructured":"Yuan, S., Li, H., Qian, X., Hao, M., Zhai, Y.: Guowen Xu. Efficient and privacy-preserving outsourcing of gradient boosting decision tree inference, IEEE Transactions on Services Computing (2024)"},{"key":"3_CR19","unstructured":"Ko, R., Mahdavi, R.A., Yoon, B., Onizuka, M.: Florian Kerschbaum, Silentwood: private inference over gradient-boosting decision forests, arXiv preprint arXiv:2411.15494 (2024)"},{"key":"3_CR20","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption., IACR Cryptology ePrint Archive, 2012:144 (2012)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u2018ene, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds, In: Advances in Cryptology\u2013ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4\u20138, 2016, Proceedings, Part I 22. year, Springer (2016)","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"3_CR22","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes, In: International Conference on the Theory and Applications of Cryptographic Techniques. year, Springer (1999)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM, 21(2), 120\u2013126 (1978)","DOI":"10.1145\/359340.359342"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts, in Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10\u201312, 2005. Proceedings 2. year, Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"3_CR25","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption., IACR Cryptology ePrint Archive, 2012:144 (2012)"},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based, in Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I. year, Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices, year, In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u2018ene, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds, in Advances in Cryptology\u2013ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4\u20138, 2016, Proceedings, Part I 22. year, Springer (2016)","DOI":"10.1007\/978-3-662-53887-6_1"},{"issue":"6","key":"3_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"3_CR31","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings, In: Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings 29. year, Springer (2010)"},{"key":"3_CR32","unstructured":"Ke, G., et al.: Lightgbm: a highly efficient gradient boosting decision tree, Adv. Neural Inf. Process. Syst. 30 (2017)"},{"key":"3_CR33","unstructured":"Feng, J., Yu, Y., Zhou, Z.-H.: Multi-layered gradient boosting decision trees, Adv. Neural Inf. Process. Syst. 31 (2018)"},{"issue":"6","key":"3_CR34","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1109\/TCBB.2019.2911071","volume":"17","author":"A Ogunleye","year":"2019","unstructured":"Ogunleye, A., Wang, Q.-G.: Xgboost model for chronic kidney disease diagnosis. IEEE\/ACM Trans. Comput. Biol. Bioinf. 17(6), 2131\u20132140 (2019)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"6","key":"3_CR35","doi-asserted-by":"publisher","first-page":"6214","DOI":"10.1007\/s11227-020-03524-3","volume":"77","author":"N Gholizadeh","year":"2021","unstructured":"Gholizadeh, N., Saadatfar, H., Hanafi, N.: K-dbscan: an improved dbscan algorithm for big data. J. Supercomput. 77(6), 6214\u20136235 (2021)","journal-title":"J. Supercomput."},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Boneh, D., Sahai, A.; Waters, B. Functional encryption: Definitions and challenges. In: Proceedings of the Theory of Cryptography Conference. Springer, pp. 253\u2013273 (2011)","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"3_CR37","unstructured":"GSL - GNU Scientific Library, http :\/\/www.gnu.org\/software\/gsl"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Zaeem, R.N., Barber, K.S.: The effect of the GDPR on privacy policies: recent progress and future promise. ACM Trans. Manage. Inf. Syst. (TMIS) 12(1), 1\u201320 (2020)","DOI":"10.1145\/3389685"},{"key":"3_CR39","unstructured":"AI Act. https:\/\/digital-strategy.ec.europa.eu\/en\/policies\/regulatory-framework-ai"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Designs Codes Cryptography, 71(1), 57\u201381 (2014)","DOI":"10.1007\/s10623-012-9720-4"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20026-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T23:31:37Z","timestamp":1778455897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20026-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032200259","9783032200266"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20026-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations and Practice of Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fps2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hub.imt-atlantique.fr\/fps2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}