{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T21:02:00Z","timestamp":1763154120578,"version":"3.45.0"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tdsc.2025.3596314","type":"journal-article","created":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T18:02:35Z","timestamp":1754503355000},"page":"7319-7333","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Decision Graph Inference From Homomorphic Lookup Table"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7495-1445","authenticated-orcid":false,"given":"Lichun","family":"Li","sequence":"first","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9633-9480","authenticated-orcid":false,"given":"Yuan","family":"Zhao","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"given":"Zhijie","family":"Liu","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1188-801X","authenticated-orcid":false,"given":"Kai","family":"Bu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Linfeng","family":"Cheng","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Shan","family":"Yin","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]}],"member":"263","reference":[{"key":"ref1","article-title":"The next generation of data-sharing in financial services: Using privacy enhancing techniques to unlock new value","author":"Blake","year":"2019","journal-title":"World Econ. Forum"},{"year":"2018","key":"ref2","article-title":"The fintech files: Playing with encrypted data - without seeing it"},{"year":"2019","key":"ref3","article-title":"Shared machine learning: Ant financial\u2019s solution for data privacy"},{"key":"ref4","first-page":"4961","article-title":"CrypTen: Secure multi-party computation meets machine learning","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","author":"Knott"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1409620.1409624"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref8","first-page":"35","article-title":"ABY3: A mixed protocol framework for machine learning","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Mohassel"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0035"},{"key":"ref10","first-page":"1651","article-title":"GAZELLE: A low latency framework for secure neural network inference","volume-title":"Proc. 27th USENIX Secur. Symp.","author":"Juvekar"},{"key":"ref11","first-page":"1501","article-title":"XONN: XNOR-based oblivious deep neural network inference","volume-title":"Proc. 28th USENIX Secur. Symp.","author":"Riazi"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3411501.3419418"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00092"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0026"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_27"},{"year":"2024","key":"ref16","article-title":"Inpher\u2019s MPC solution for credit modeling and inference"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0015"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623095"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/2699986"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref23","first-page":"3146","article-title":"LightGBM: A highly efficient gradient boosting decision tree","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ke"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.29172\/7c2a6982-6d72-4cd8-bba6-2fccb06a7011"},{"year":"2016","key":"ref25","article-title":"Anthony Goldbloom gives you the secret to winning Kaggle competitions"},{"issue":"2","key":"ref26","first-page":"29","article-title":"Credit scoring models: Techniques and issues","volume":"7","author":"Eddy","year":"2017","journal-title":"J. Adv. Res. Bus. Manage. Stud."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.05.030"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1504\/IJFSM.2009.026635"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-2070(00)00034-0"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-95729-6_16"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73458-1_30"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2008.017048"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2009.028031"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.23166"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3517413"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3627106.3627131"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3231784"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3202916"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70890-9_16"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0023"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080506"},{"key":"ref48","article-title":"Somewhat practical fully homomorphic encryption","volume":"2012","author":"Fan","year":"2012","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"ref51","article-title":"Cheetah: Lean and fast secure two-party deep neural network inference (full version)","volume-title":"IACR Cryptol. ePrint Arch.","volume":"2022","author":"Huang","year":"2022"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813624"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354255"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560702"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.3390\/s23052624"},{"key":"ref64","article-title":"Faster private decision tree evaluation for batched input from homomorphic encryption","volume-title":"IACR Cryptol. ePrint Arch.","volume":"2024","author":"Cong","year":"2024"},{"key":"ref65","article-title":"BPDTE: Batch private decision tree evaluation via amortized efficient private comparison","volume-title":"IACR Cryptol. ePrint Arch.","volume":"2024","author":"Liang","year":"2024"},{"key":"ref66","first-page":"217","article-title":"Fully homomorphic training and inference on binary decision tree and random forest","volume-title":"Proc. 29th Eur. Symp. Res. Comput. Secur.","author":"Shin"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2108650"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12146-4_10"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"article-title":"SilentWood: Private inference over gradient-boosting decision forests","year":"2024","author":"Ko","key":"ref70"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/11242243\/11119092.pdf?arnumber=11119092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T21:00:54Z","timestamp":1763154054000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11119092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":62,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2025.3596314","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"type":"print","value":"1545-5971"},{"type":"electronic","value":"1941-0018"},{"type":"electronic","value":"2160-9209"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}