{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:41:50Z","timestamp":1771958510119,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Adelaide Scholarship International"},{"name":"Scholarship of the Defence Systems Innovation Centre (DSIC)"},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP0985063"],"award-info":[{"award-number":["DP0985063"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2015,11,1]]},"DOI":"10.1109\/tdsc.2014.2382573","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T20:23:44Z","timestamp":1419020624000},"page":"640-651","source":"Crossref","is-referenced-by-count":14,"title":["Privacy-Preserving Fraud Detection Across Multiple Phone Record Databases"],"prefix":"10.1109","volume":"12","author":[{"given":"Wilko","family":"Henecka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Roughan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","article-title":"Efficient privacy-preserving biometric identification","author":"evans","year":"0","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref10","year":"0"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-44816-0_11","article-title":"Communities of interest","author":"cortes","year":"2001","journal-title":"Advances in Intelligent Data Analysis"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X139162"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref15","first-page":"1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"0","journal-title":"Advances in Cryptology Proc Of EUROCRYPT"},{"key":"ref16","first-page":"52","article-title":"An efficient protocol for secure two-party computation in the presence of malicious adversaries","volume":"4515","author":"lindell","year":"0","journal-title":"Proc EUROCRYPT"},{"key":"ref17","first-page":"250","article-title":"Secure Two-Party computation is practical","author":"pinkas","year":"0","journal-title":"Proc 15th Int Conf Theory Appl Cryptol Inform Secur Adv Cryptol"},{"key":"ref18","first-page":"35","article-title":"Faster secure two-party computation using garbled circuits","author":"huang","year":"0","journal-title":"Proc Usenix Secur Symp"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484369"},{"key":"ref28","first-page":"486","article-title":"Improved garbled circuit: Free XOR gates and applications","author":"kolesnikov","year":"0","journal-title":"Proc 35th Int Colloquium Automata Languages Programm"},{"key":"ref4","article-title":"A comprehensive survey of data mining-based fraud detection research","volume":"abs 1009 6119","author":"phua","year":"2010","journal-title":"CoRR"},{"key":"ref27","first-page":"1","article-title":"Improved garbled circuit building blocks and applications to auctions and computing minima","author":"kolesnikov","year":"0","journal-title":"Proc 8th Int Conf Cryptol Netw Secur"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1214\/ss\/1042727940","article-title":"Statistical fraud detection: A review","volume":"17","author":"bolton","year":"2002","journal-title":"Statistical Sci"},{"key":"ref6","year":"0"},{"key":"ref29","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1198\/TECH.2009.08136"},{"key":"ref8","first-page":"147","article-title":"Secure distributed subgroup discovery in horizontally partitioned data","volume":"4","author":"grosskreutz","year":"2011","journal-title":"Trans Data Privacy"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2004.10081"},{"key":"ref2","year":"0"},{"key":"ref9","author":"bianco","year":"2010","journal-title":"The Big Lie Spying Scandal and Ethical Collapse at Hewlett Packard"},{"key":"ref1","year":"0"},{"key":"ref20","first-page":"20","article-title":"Fairplay—A secure two-party computation system","author":"malkhi","year":"0","journal-title":"Proc 13th Conf USENIX Secur Symp"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183678"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032742"},{"key":"ref23","year":"0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343842"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/1932409"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/7322332\/06990589.pdf?arnumber=6990589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:11Z","timestamp":1642004891000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6990589\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,1]]},"references-count":30,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2014.2382573","relation":{},"ISSN":["1545-5971"],"issn-type":[{"value":"1545-5971","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11,1]]}}}