{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:17:15Z","timestamp":1768979835209,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031547690","type":"print"},{"value":"9783031547706","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-54770-6_12","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"288-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-Party Decision Tree Training from\u00a0Updatable Order-Revealing Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-4647-4228","authenticated-orcid":false,"given":"Robin","family":"Berger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7244-7753","authenticated-orcid":false,"given":"Felix","family":"D\u00f6rre","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3510-9669","authenticated-orcid":false,"given":"Alexander","family":"Koch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"12_CR1","unstructured":"Abadi, M., et al.: TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems. Software available from tensorflow.org (2015). https:\/\/www.tensorflow.org\/"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Abspoel, M., Escudero, D., Volgushev, N.: Secure training of decision trees with continuous attributes. Proc. Privacy Enhanc. Technol. 2021(1), 167\u2013187 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0010","DOI":"10.2478\/popets-2021-0010"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Akavia, A., Leibovich, M., Resheff, Y.S., Ron, R., Shahar, M., Vald, M.: Privacy-preserving decision trees training and prediction. ACM Trans. Priv. Secur. 25(3), 24:1\u201324:30 (2022). https:\/\/doi.org\/10.1145\/3517197","DOI":"10.1145\/3517197"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bent\u00e9jac, C., Cs\u00f6rg\u0151, A., Mart\u00ednez-Mu\u00f1oz, G.: A comparative analysis of gradient boosting algorithms. Artif. Intell. Rev. 54(3), 1937\u20131967 (2021). https:\/\/doi.org\/10.1007\/s10462-020-09896-5","DOI":"10.1007\/s10462-020-09896-5"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lewi, K., Raykova, M., Sahai, A., Zhandry, M., Zimmerman, J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, LNCS, vol. 9057, pp. 563\u2013594. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_19","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"12_CR6","unstructured":"Buitinck, L., et al.: API design for machine learning software: experiences from the scikit-learn project. In: ECML PKDD Workshop: Languages for Data Mining and Machine Learning, pp. 108\u2013122 (2013)"},{"key":"12_CR7","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. Cryptology ePrint Archive, Report 2000\/067 (2000). https:\/\/eprint.iacr.org\/2000\/067"},{"key":"12_CR8","unstructured":"Chaudhuri, K., Monteleoni, C.: Privacy-preserving logistic regression. Adv. Neural Inf. Process. Syst. 21 (2008)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Chenette, N., Lewi, K., Weis, S.A., Wu, D.J.: Practical order-revealing encryption with limited leakage. In: Peyrin, T. (eds) FSE 2016. LNCS, vol. 9783. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_24","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"12_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, pp. 563\u2013577 (2022). https:\/\/doi.org\/10.1145\/3548606.3560702","DOI":"10.1145\/3548606.3560702"},{"key":"12_CR12","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data (2002)"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Bet\u00fcl Durak, F., DuBuisson, T.M., Cash, D.: What Else is Revealed by Order-Revealing Encryption?, pp. 1155\u20131166 (2016). https:\/\/doi.org\/10.1145\/2976749.2978379","DOI":"10.1145\/2976749.2978379"},{"key":"12_CR14","unstructured":"Frery, J., et al.: Privacy-Preserving Tree-Based Inference with Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2023\/258 (2023). https:\/\/eprint.iacr.org\/2023\/258"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Grubbs, P., Sekniqi, K., Bindschaedler, V., Naveed, M., Ristenpart, T.: Leakage-abuse attacks against order-revealing encryption. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 655\u2013672 (2017). https:\/\/doi.org\/10.1109\/SP.2017.44","DOI":"10.1109\/SP.2017.44"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Hamada, K., Ikarashi, D., Kikuchi, R., Chida, K.: Efficient decision tree training with new data structure for secure multi-party computation. Proc. Privacy Enhanc. Technol. 2023(1), 343\u2013364 (2023). https:\/\/doi.org\/10.56553\/popets-2023-0021","DOI":"10.56553\/popets-2023-0021"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"de Hoogh, S., Schoenmakers, B., Chen, P., op den Akker, H.: Practical secure decision tree learning in a teletreatment application. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014, LNCS, vol. 8437, pp. 179\u2013194. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_12","DOI":"10.1007\/978-3-662-45472-5_12"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Jurado, M., Palamidessi, C., Smith, G.: A Formal Information-Theoretic Leakage Analysis of Order-Revealing Encryption, pp. 1\u201316 (2021). https:\/\/doi.org\/10.1109\/CSF51468.2021.00046","DOI":"10.1109\/CSF51468.2021.00046"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Keller, M.: MP-SPDZ: A Versatile Framework for Multi-Party Computation, pp. 1575\u20131590 (2020). https:\/\/doi.org\/10.1145\/3372297.3417872","DOI":"10.1145\/3372297.3417872"},{"key":"12_CR20","unstructured":"Knott, B., Venkataraman, S., Hannun, A., Sengupta, S., Ibrahim, M., van der Maaten, L.: Crypten: secure multi-party computation meets machine learning. Adv. Neural. Inf. Process. Syst. 34, 4961\u20134973 (2021)"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Kubat, M.: An Introduction to Machine Learning. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63913-0","DOI":"10.1007\/978-3-319-63913-0"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Lee, J.-W., et al.: Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10, 30039\u201330054 (2022)","DOI":"10.1109\/ACCESS.2022.3159694"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Lewi, K., Wu, D.J.: Order-Revealing Encryption: New Constructions, Applications, and Lower Bounds, pp. 1167\u20131178 (2016). https:\/\/doi.org\/10.1145\/2976749.2978376","DOI":"10.1145\/2976749.2978376"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Li, Y., Wang, H., Zhao, Y.: Delegatable Order-Revealing Encryption, pp. 134\u2013147 (2019). https:\/\/doi.org\/10.1145\/3321705.3329829","DOI":"10.1145\/3321705.3329829"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (eds.) CRYPTO 2000. LNCS, vol. 1880. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_3","DOI":"10.1007\/3-540-44598-6_3"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Liu, X., Deng, R.H., Raymond, K.-K., Choo, J.: An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Trans. Inf. Forens. Secur. 11(11), 2401\u20132414 (2016). https:\/\/doi.org\/10.1109\/TIFS.2016.2573770","DOI":"10.1109\/TIFS.2016.2573770"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Lv, C., Wang, J., Sun, S.-F., Wang, Y., Qi, S., Chen, X.: Towards practical multi-client order-revealing encryption: improvement and application. In: IEEE Transactions on Dependable and Secure Computing (2023)","DOI":"10.1109\/TDSC.2023.3268652"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed Pseudo-random Functions and KDCs, pp. 327\u2013346 (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_23","DOI":"10.1007\/3-540-48910-X_23"},{"key":"12_CR29","unstructured":"Ohrimenko, O., et al.: Oblivious Multi-party Machine Learning on Trusted Processors, pp. 619\u2013636 (2016)"},{"key":"12_CR30","unstructured":"Ross Quinlan, J. C4. 5: Programs for Machine Learning. Elsevier (2014)"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Tangirala, S.: Evaluating the impact of GINI index and information gain on classification using decision tree classifier algorithm. Int. J. Adv. Comput. Sci. Appl. 11(2), 612\u2013619 (2020)","DOI":"10.14569\/IJACSA.2020.0110277"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Vaidya, J., Clifton, C., Kantarcioglu, M., Scott Patterson, A.: Privacy-preserving decision trees over vertically partitioned data. ACM Trans. Knowl. Discov. Data 2(3), 14:1\u201314:27 (2008). https:\/\/doi.org\/10.1145\/1409620.1409624","DOI":"10.1145\/1409620.1409624"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54770-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:14:23Z","timestamp":1709655263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_12","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":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","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":"54","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":"23% - 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":"4","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":"4-6","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)"}}]}}