{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:01:49Z","timestamp":1777964509965,"version":"3.51.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tdsc.2019.2940020","type":"journal-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T06:08:27Z","timestamp":1568182107000},"page":"1-1","source":"Crossref","is-referenced-by-count":24,"title":["Blindfolded Evaluation of Random Forests with Multi-Key Homomorphic Encryption"],"prefix":"10.1109","author":[{"given":"Asma","family":"Aloufi","sequence":"first","affiliation":[]},{"given":"Peizhao","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Harry W. H.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Sherman S. M.","family":"Chow","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"UCI machine learning repository","author":"dua","year":"2017"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2016.0041"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2014.04.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.02.004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.21"},{"key":"ref36","first-page":"619","article-title":"Oblivious multi-party machine learning on trusted processors","author":"ohrimenko","year":"2016","journal-title":"Proc 25th USENIX Conf USENIX Security"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134056"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1017\/S1930297500006239","article-title":"FFTrees: A toolbox to create, visualize, and evaluate fast-and-frugal decision trees","volume":"12","author":"phillips","year":"2017","journal-title":"Measurement, Judgment and Decision Making"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-3-319-70503-3_20","article-title":"Batched multi-hop multi-key fhe from Ring-LWE with compact ciphertext extension","author":"chen","year":"2017","journal-title":"Proc Theory Cryptography Conf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2535925"},{"key":"ref13","first-page":"595","article-title":"Fast cryptographic primitives and circular-secure encryption based on hard learning problems","author":"applebaum","year":"2009","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref14","first-page":"483","article-title":"Multiparty computation with low communication, computation and interaction via threshold FHE","author":"asharov","year":"2012","journal-title":"Proc Annu Int Conf Theory Appl Cryptographic Techn"},{"key":"ref15","first-page":"630","article-title":"Multi-identity and multi-key leveled FHE from learning with errors","author":"clear","year":"2015","journal-title":"Proc Annu Cryptology Conf"},{"key":"ref16","first-page":"217","article-title":"Multi-key FHE from LWE, revisited","author":"peikert","year":"2016","journal-title":"Proc Theory Cryptography Conf"},{"key":"ref17","first-page":"75","article-title":"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based","author":"gentry","year":"2013","journal-title":"Proc Annu Cryptology Conf"},{"key":"ref18","first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"van dijk","year":"2009","journal-title":"Proc Annu Int Conf Theory Appl Cryptographic Techn"},{"key":"ref19","article-title":"Efficient parallel binary operations on homomorphic encrypted real numbers.","author":"basilakis","year":"2018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref4","article-title":"Notice to the secretary of HHS breach of unsecured protected health information","year":"0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"ref3","article-title":"Safer but not immune: Cloud lessons from the equifax breach","author":"linthicum","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0043"},{"key":"ref29","first-page":"243","article-title":"Private yet efficient decision tree evaluation","author":"joye","year":"2018","journal-title":"Proc IFIP Annu Conf Data Appl Security Privacy"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73458-1_30"},{"key":"ref7","first-page":"494","article-title":"Privacy-preserving decision trees evaluation via linear functions","author":"tai","year":"2017","journal-title":"Proc Eur Symp Res Comput Security"},{"key":"ref2","article-title":"120 million american households exposed in ‘massive’ consumerview database leak","author":"fox-brewster","year":"2017"},{"key":"ref9","article-title":"Comparing encrypted data","author":"veugen","year":"2011"},{"key":"ref1","first-page":"173","author":"hofmann","year":"2005","journal-title":"Collaborative Machine Learning"},{"key":"ref20","first-page":"318","article-title":"A comparison of the homomorphic encryption schemes FV and YASHE","author":"lepoint","year":"2014","journal-title":"Proc Int Conf Cryptology Africa"},{"key":"ref22","first-page":"554","article-title":"Algorithms in HElib","author":"halevi","year":"2014","journal-title":"Proc Annu Cryptology Conf"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"ref42","article-title":"Simple Encrypted Arithmetic Library (release 3.1.0)","year":"2018"},{"key":"ref24","article-title":"CDC diseases and conditions","year":"0"},{"key":"ref41","first-page":"409","article-title":"Homomorphic encryption for arithmetic of approximate numbers","author":"cheon","year":"2017","journal-title":"Proc Int Conf Theory Appl Cryptology Inf Security"},{"key":"ref23","article-title":"How to exchange secrets with oblivious transfer","author":"rabin","year":"2005"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","article-title":"Privacy-preserving face recognition","author":"erkin","year":"2009","journal-title":"Proc Privacy Enhancing Technol Symp"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2012.6412624"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/4358699\/08827928.pdf?arnumber=8827928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T03:29:57Z","timestamp":1695180597000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8827928\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/tdsc.2019.2940020","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}