{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:46:26Z","timestamp":1768693586350,"version":"3.49.0"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"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":[[2019,3,1]]},"DOI":"10.1109\/tdsc.2017.2679189","type":"journal-article","created":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T19:29:37Z","timestamp":1488914977000},"page":"217-230","source":"Crossref","is-referenced-by-count":102,"title":["Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation"],"prefix":"10.1109","volume":"16","author":[{"given":"Martine","family":"De Cock","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7588-2410","authenticated-orcid":false,"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[]},{"given":"Caleb","family":"Horst","sequence":"additional","affiliation":[]},{"given":"Raj","family":"Katti","sequence":"additional","affiliation":[]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]},{"given":"Wing-Sea","family":"Poon","sequence":"additional","affiliation":[]},{"given":"Stacey","family":"Truex","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/10958513_12"},{"key":"ref38","article-title":"e1071: Misc Functions of the Department of Statistics, Probability Theory Group (Formerly: E1071)","author":"meyer","year":"2015"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"ref32","first-page":"93","article-title":"Universally composable zero-knowledge arguments and commitments from signature cards","author":"hofheinz","year":"2005","journal-title":"Proc of Central European Conf on Cryptology"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_22"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813664"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"ref28","first-page":"509","article-title":"On the composability of statistically secure bit commitments","volume":"14","author":"dowsley","year":"2013","journal-title":"J Internet Technol"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E94.A.725"},{"key":"ref29","first-page":"155","article-title":"Support vector regression machines","author":"drucker","year":"1996","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-70992-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26059-4_20"},{"key":"ref22","article-title":"Design of large scale applications of secure multiparty computation: Secure linear programming","author":"de hoogh","year":"2012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45472-5_12"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17955-6_25"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_11"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17470-9_12"},{"key":"ref25","first-page":"1","article-title":"On the possibility of universally composable commitments based on noisy channels","author":"dowsley","year":"0","journal-title":"Proc Brazilian Symp Inf Syst"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_24"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_6"},{"key":"ref54","article-title":"Privately evaluating decision trees and random forests","volume":"2015","author":"wu","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2373811"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-014-0247-8"},{"key":"ref10","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24852-1_26"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/509978.509980"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2808769.2808774"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2476783"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.71"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68535-9_40"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258637"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016501125022"},{"key":"ref7","first-page":"92","article-title":"Server-assisted cryptography","author":"beaver","year":"1998","journal-title":"Proceedings New Security Paradigms Workshop"},{"key":"ref49","article-title":"Primitives and applications for multi-party computation","author":"toft","year":"2007"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"ref46","article-title":"Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer","author":"rivest","year":"1999"},{"key":"ref45","year":"2015","journal-title":"R A Language and Environment for Statistical Computing"},{"key":"ref48","article-title":"Recursive partitioning and regression trees","author":"therneau","year":"0"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_31"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"ref41","first-page":"841","article-title":"On discriminative versus generative classifiers: A comparison of logistic regression and naive bayes","author":"ng","year":"2001","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref44","article-title":"Actively secure two-party computation: Efficient beaver triple generation","author":"pullonen","year":"2013"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_31"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/8666010\/07873244.pdf?arnumber=7873244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:53:02Z","timestamp":1657745582000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7873244\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":54,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2017.2679189","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,3,1]]}}}