{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T02:46:18Z","timestamp":1786416378941,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CyberSecurity Research Flanders","award":["VR20192203"],"award-info":[{"award-number":["VR20192203"]}]},{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["FA8750-19-C-0502"],"award-info":[{"award-number":["FA8750-19-C-0502"]}]},{"name":"Research Council KU Leuven","award":["C24\/18\/049"],"award-info":[{"award-number":["C24\/18\/049"]}]},{"name":"Space and Naval Warfare Systems Center, Pacific (SSC Pacific)","award":["HR0011-21-C-0034"],"award-info":[{"award-number":["HR0011-21-C-0034"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560702","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"563-577","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["SortingHat"],"prefix":"10.1145","author":[{"given":"Kelong","family":"Cong","sequence":"first","affiliation":[{"name":"KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Debajyoti","family":"Das","sequence":"additional","affiliation":[{"name":"KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeongeun","family":"Park","sequence":"additional","affiliation":[{"name":"KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hilder V.L.","family":"Pereira","sequence":"additional","affiliation":[{"name":"KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"PIR with Compressed Queries and Amortized Query Processing. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 962--979","author":"Angel Sebastian","year":"2018","unstructured":"Sebastian Angel , Hao Chen , Kim Laine , and Srinath T. V. Setty . 2018 . PIR with Compressed Queries and Amortized Query Processing. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 962--979 . https:\/\/doi.org\/ 10.1109\/SP. 2018 .00062 10.1109\/SP.2018.00062 Sebastian Angel, Hao Chen, Kim Laine, and Srinath T. V. Setty. 2018. PIR with Compressed Queries and Amortized Query Processing. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 962--979. https:\/\/doi.org\/ 10.1109\/SP.2018.00062"},{"key":"e_1_3_2_1_2_1","volume-title":"Decision tree classifiers for automated medical diagnosis. Neural Computing and Applications 23 (11","author":"Azar Ahmad","year":"2013","unstructured":"Ahmad Azar and Shereen El-Metwally . 2013. Decision tree classifiers for automated medical diagnosis. Neural Computing and Applications 23 (11 2013 ), 2387--2403. https:\/\/doi.org\/10.1007\/s00521-012--1196--7 10.1007\/s00521-012--1196--7 Ahmad Azar and Shereen El-Metwally. 2013. Decision tree classifiers for automated medical diagnosis. Neural Computing and Applications 23 (11 2013), 2387--2403. https:\/\/doi.org\/10.1007\/s00521-012--1196--7"},{"key":"e_1_3_2_1_3_1","volume-title":"Secure Evaluation of Private Linear Branching Programs with Medical Applications. In ESORICS 2009 (LNCS), Michael Backes and Peng Ning (Eds.)","volume":"5789","author":"Barni Mauro","year":"2009","unstructured":"Mauro Barni , Pierluigi Failla , Vladimir Kolesnikov , Riccardo Lazzeretti , AhmadReza Sadeghi , and Thomas Schneider . 2009 . Secure Evaluation of Private Linear Branching Programs with Medical Applications. In ESORICS 2009 (LNCS), Michael Backes and Peng Ning (Eds.) , Vol. 5789 . Springer, Heidelberg, 424--439. https: \/\/doi.org\/10.1007\/978--3--642-04444--1_26 10.1007\/978--3--642-04444--1_26 Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov, Riccardo Lazzeretti, AhmadReza Sadeghi, and Thomas Schneider. 2009. Secure Evaluation of Private Linear Branching Programs with Medical Applications. In ESORICS 2009 (LNCS), Michael Backes and Peng Ning (Eds.), Vol. 5789. Springer, Heidelberg, 424--439. https: \/\/doi.org\/10.1007\/978--3--642-04444--1_26"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_5_1","volume-title":"Viet Tung Hoang, and Phillip Rogaway","author":"Bellare Mihir","year":"2012","unstructured":"Mihir Bellare , Viet Tung Hoang, and Phillip Rogaway . 2012 . Foundations of garbled circuits. In ACM CCS 2012, Ting Yu, George Danezis, and Virgil D. Gligor (Eds.). ACM Press , 784--796. https:\/\/doi.org\/10.1145\/2382196.2382279 10.1145\/2382196.2382279 Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. 2012. Foundations of garbled circuits. In ACM CCS 2012, Ting Yu, George Danezis, and Virgil D. Gligor (Eds.). ACM Press, 784--796. https:\/\/doi.org\/10.1145\/2382196.2382279"},{"key":"e_1_3_2_1_6_1","volume-title":"Smart","author":"Bonte Charlotte","year":"2022","unstructured":"Charlotte Bonte , Ilia Iliashenko , Jeongeun Park , Hilder V. L. Pereira , and Nigel P . Smart . 2022 . FINAL : Faster FHE instantiated with NTRU and LWE. Cryptology ePrint Archive, Report 2022\/074. (2022). https:\/\/ia.cr\/2022\/074. Charlotte Bonte, Ilia Iliashenko, Jeongeun Park, Hilder V. L. Pereira, and Nigel P. Smart. 2022. FINAL: Faster FHE instantiated with NTRU and LWE. Cryptology ePrint Archive, Report 2022\/074. (2022). https:\/\/ia.cr\/2022\/074."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54388-7_8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354226"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_15_1","volume-title":"TFHE: Fast Fully Homomorphic Encryption Library. (August","author":"Chillotti Ilaria","year":"2016","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . August 2016 . TFHE: Fast Fully Homomorphic Encryption Library. (August 2016). https:\/\/tfhe.github.io\/tfhe\/. Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. August 2016. TFHE: Fast Fully Homomorphic Encryption Library. (August 2016). https:\/\/tfhe.github.io\/tfhe\/."},{"key":"e_1_3_2_1_16_1","volume-title":"WAHC 2020--8th Workshop on Encrypted Computing & Applied Homomorphic Cryptography","volume":"15","author":"Chillotti Ilaria","year":"2020","unstructured":"Ilaria Chillotti , Marc Joye , Damien Ligier , Jean-Baptiste Orfila , and Samuel Tap . 2020 . CONCRETE: Concrete Operates oN Ciphertexts Rapidly by Extending TfhE . In WAHC 2020--8th Workshop on Encrypted Computing & Applied Homomorphic Cryptography , Vol. 15 . Ilaria Chillotti, Marc Joye, Damien Ligier, Jean-Baptiste Orfila, and Samuel Tap. 2020. CONCRETE: Concrete Operates oN Ciphertexts Rapidly by Extending TfhE. In WAHC 2020--8th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, Vol. 15."},{"key":"e_1_3_2_1_17_1","volume-title":"Smart","author":"Costache Ana","year":"2016","unstructured":"Ana Costache and Nigel P . Smart . 2016 . Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?. In CT-RSA 2016 (LNCS), Kazue Sako (Ed.), Vol. 9610 . Springer , Heidelberg, 325--340. https:\/\/doi.org\/10.1007\/978--3--319- 29485--8_19 10.1007\/978--3--319- Ana Costache and Nigel P. Smart. 2016. Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?. In CT-RSA 2016 (LNCS), Kazue Sako (Ed.), Vol. 9610. Springer, Heidelberg, 325--340. https:\/\/doi.org\/10.1007\/978--3--319- 29485--8_19"},{"key":"e_1_3_2_1_18_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. (2017). http:\/\/archive.ics.uci.edu\/ml  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_19_1","volume-title":"FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT","author":"Ducas L\u00e9o","year":"2015","unstructured":"L\u00e9o Ducas and Daniele Micciancio . 2015 . FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT 2015, Part I (LNCS), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9056 . Springer , Heidelberg, 617--640. https: \/\/doi.org\/10.1007\/978--3--662--46800--5_24 10.1007\/978--3--662--46800--5_24 L\u00e9o Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT 2015, Part I (LNCS), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9056. Springer, Heidelberg, 617--640. https: \/\/doi.org\/10.1007\/978--3--662--46800--5_24"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1895489.1895514"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_3_2_1_22_1","volume-title":"Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012 (LNCS), David Pointcheval and Thomas Johansson (Eds.)","volume":"7237","author":"Gentry Craig","unstructured":"Craig Gentry , Shai Halevi , and Nigel P. Smart . 2012 . Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012 (LNCS), David Pointcheval and Thomas Johansson (Eds.) , Vol. 7237 . Springer, Heidelberg, 465--482. https: \/\/doi.org\/10.1007\/978--3--642--29011--4_28 10.1007\/978--3--642--29011--4_28 Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012 (LNCS), David Pointcheval and Thomas Johansson (Eds.), Vol. 7237. Springer, Heidelberg, 465--482. https: \/\/doi.org\/10.1007\/978--3--642--29011--4_28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_14"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-65277-7_3"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0046"},{"key":"e_1_3_2_1_26_1","volume-title":"Round-Optimal Secure Two-Party Computation. In CRYPTO 2004 (LNCS), Matthew Franklin (Ed.)","volume":"3152","author":"Katz Jonathan","year":"2004","unstructured":"Jonathan Katz and Rafail Ostrovsky . 2004 . Round-Optimal Secure Two-Party Computation. In CRYPTO 2004 (LNCS), Matthew Franklin (Ed.) , Vol. 3152 . Springer, Heidelberg, 335--354. https:\/\/doi.org\/10.1007\/978--3--540--28628--8_21 10.1007\/978--3--540--28628--8_21 Jonathan Katz and Rafail Ostrovsky. 2004. Round-Optimal Secure Two-Party Computation. In CRYPTO 2004 (LNCS), Matthew Franklin (Ed.), Vol. 3152. Springer, Heidelberg, 335--354. https:\/\/doi.org\/10.1007\/978--3--540--28628--8_21"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"e_1_3_2_1_28_1","volume-title":"A Two-step Method to Construct Credit Scoring Models with Data Mining Techniques. The International Journal of Business and Information 1","author":"Koh Hian Chye","year":"2006","unstructured":"Hian Chye Koh , Wei Chin . Tan, and Chwee Peng Goh . 2006. A Two-step Method to Construct Credit Scoring Models with Data Mining Techniques. The International Journal of Business and Information 1 ( 2006 ). Hian Chye Koh, Wei Chin. Tan, and Chwee Peng Goh. 2006. A Two-step Method to Construct Credit Scoring Models with Data Mining Techniques. The International Journal of Business and Information 1 (2006)."},{"key":"e_1_3_2_1_29_1","volume-title":"On CCA-Secure Somewhat Homomorphic Encryption. In SAC 2011 (LNCS), Ali Miri and Serge Vaudenay (Eds.)","volume":"7118","author":"Loftus Jake","year":"2012","unstructured":"Jake Loftus , Alexander May , Nigel P. Smart , and Frederik Vercauteren . 2012 . On CCA-Secure Somewhat Homomorphic Encryption. In SAC 2011 (LNCS), Ali Miri and Serge Vaudenay (Eds.) , Vol. 7118 . Springer, Heidelberg, 55--72. https: \/\/doi.org\/10.1007\/978--3--642--28496-0_4 10.1007\/978--3--642--28496-0_4 Jake Loftus, Alexander May, Nigel P. Smart, and Frederik Vercauteren. 2012. On CCA-Secure Somewhat Homomorphic Encryption. In SAC 2011 (LNCS), Ali Miri and Serge Vaudenay (Eds.), Vol. 7118. Springer, Heidelberg, 55--72. https: \/\/doi.org\/10.1007\/978--3--642--28496-0_4"},{"key":"e_1_3_2_1_30_1","volume-title":"ASIACCS 18, Jong Kim, Gail-Joon Ahn, Seungjoo Kim, Yongdae Kim, Javier L\u00f3pez","author":"Lu Wenjie","unstructured":"Wenjie Lu , Jun-Jie Zhou , and Jun Sakuma . 2018. Non-interactive and Output Expressive Private Comparison from Homomorphic Encryption . In ASIACCS 18, Jong Kim, Gail-Joon Ahn, Seungjoo Kim, Yongdae Kim, Javier L\u00f3pez , and Taesoo Kim (Eds.). ACM Press , 67--74. Wenjie Lu, Jun-Jie Zhou, and Jun Sakuma. 2018. Non-interactive and Output Expressive Private Comparison from Homomorphic Encryption. In ASIACCS 18, Jong Kim, Gail-Joon Ahn, Seungjoo Kim, Yongdae Kim, Javier L\u00f3pez, and Taesoo Kim (Eds.). ACM Press, 67--74."},{"key":"e_1_3_2_1_31_1","volume-title":"Improved Filter Permutators for Efficient FHE: Better Instances and Implementations. In INDOCRYPT 2019 (LNCS), Feng Hao, Sushmita Ruj, and Sourav Sen Gupta (Eds.)","volume":"11898","author":"M\u00e9aux Pierrick","year":"2019","unstructured":"Pierrick M\u00e9aux , Claude Carlet , Anthony Journault , and Fran\u00e7ois-Xavier Standaert . 2019 . Improved Filter Permutators for Efficient FHE: Better Instances and Implementations. In INDOCRYPT 2019 (LNCS), Feng Hao, Sushmita Ruj, and Sourav Sen Gupta (Eds.) , Vol. 11898 . Springer, Heidelberg, 68--91. https: \/\/doi.org\/10.1007\/978--3-030--35423--7_4 10.1007\/978--3-030--35423--7_4 Pierrick M\u00e9aux, Claude Carlet, Anthony Journault, and Fran\u00e7ois-Xavier Standaert. 2019. Improved Filter Permutators for Efficient FHE: Better Instances and Implementations. In INDOCRYPT 2019 (LNCS), Feng Hao, Sushmita Ruj, and Sourav Sen Gupta (Eds.), Vol. 11898. Springer, Heidelberg, 68--91. https: \/\/doi.org\/10.1007\/978--3-030--35423--7_4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59013-0_5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75245-3_13"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"e_1_3_2_1_36_1","volume-title":"Top--Down Induction of Decision Trees Classifiers--A survey. Systems, Man, and Cybernetics, Part C: Applications and Reviews","author":"Rokach Lior","year":"2005","unstructured":"Lior Rokach and Oded Maimon . 2005. Top--Down Induction of Decision Trees Classifiers--A survey. Systems, Man, and Cybernetics, Part C: Applications and Reviews , IEEE Transactions on ( 2005 ), 487. Lior Rokach and Oded Maimon. 2005. Top--Down Induction of Decision Trees Classifiers--A survey. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on (2005), 487."},{"key":"e_1_3_2_1_37_1","volume-title":"Data Mining with Decision Trees","author":"Rokach Lior","unstructured":"Lior Rokach and Oded Maimon . 2014. Data Mining with Decision Trees ( 2 nd ed.). WORLD SCIENTIFIC. https:\/\/doi.org\/10.1142\/9097 arXiv:https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/9097 10.1142\/9097 Lior Rokach and Oded Maimon. 2014. Data Mining with Decision Trees (2nd ed.). WORLD SCIENTIFIC. https:\/\/doi.org\/10.1142\/9097 arXiv:https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/9097","edition":"2"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEMBS.2011.6089901"},{"key":"e_1_3_2_1_39_1","unstructured":"N.P. Smart and F. Vercauteren. 2011. Fully Homomorphic SIMD Operations. Cryptology ePrint Archive Report 2011\/133. (2011). https:\/\/eprint.iacr.org\/2011\/ 133.  N.P. Smart and F. Vercauteren. 2011. Fully Homomorphic SIMD Operations. Cryptology ePrint Archive Report 2011\/133. (2011). https:\/\/eprint.iacr.org\/2011\/ 133."},{"key":"e_1_3_2_1_40_1","volume-title":"ESORICS","volume":"10493","author":"Tai Raymond K. H.","year":"2017","unstructured":"Raymond K. H. Tai , Jack P. K. Ma , Yongjun Zhao , and Sherman S. M. Chow . 2017. Privacy-Preserving Decision Trees Evaluation via Linear Functions . In ESORICS 2017 , Part II (LNCS), Simon N. Foley, Dieter Gollmann, and Einar Snekkenes (Eds.) , Vol. 10493 . Springer, Heidelberg, 494--512. https:\/\/doi.org\/10.1007\/978--3- 319--66399--9_27 10.1007\/978--3- Raymond K. H. Tai, Jack P. K. Ma, Yongjun Zhao, and Sherman S. M. Chow. 2017. Privacy-Preserving Decision Trees Evaluation via Linear Functions. In ESORICS 2017, Part II (LNCS), Simon N. Foley, Dieter Gollmann, and Einar Snekkenes (Eds.), Vol. 10493. Springer, Heidelberg, 494--512. https:\/\/doi.org\/10.1007\/978--3- 319--66399--9_27"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49669-2_10"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0015"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2641190.2641198"},{"key":"e_1_3_2_1_45_1","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques.","author":"Witten Ian H","year":"2011","unstructured":"Ian H Witten , Eibe Frank , and Mark A Hall . 2011 . Data Mining: Practical Machine Learning Tools and Techniques. (2011). Ian H Witten, Eibe Frank, and Mark A Hall. 2011. Data Mining: Practical Machine Learning Tools and Techniques. (2011)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0043"},{"key":"e_1_3_2_1_47_1","volume-title":"27th","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986. How to Generate and Exchange Secrets (Extended Abstract) . In 27th FOCS. IEEE Computer Society Press , 162--167. https:\/\/doi.org\/ 10.1109\/SFCS. 1986 .25 10.1109\/SFCS.1986.25 Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th FOCS. IEEE Computer Society Press, 162--167. https:\/\/doi.org\/ 10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0020"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:05Z","timestamp":1750182665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560702"}},"subtitle":["Efficient Private Decision Tree Evaluation via Homomorphic Encryption and Transciphering"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":48,"alternative-id":["10.1145\/3548606.3560702","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560702","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}