{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:04:47Z","timestamp":1778256287468,"version":"3.51.4"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1011984"],"award-info":[{"award-number":["CNS-1011984"]}],"id":[{"id":"10.13039\/100000001","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":[[2016,9,1]]},"DOI":"10.1109\/tdsc.2015.2415482","type":"journal-article","created":{"date-parts":[[2015,3,23]],"date-time":"2015-03-23T18:32:19Z","timestamp":1427135539000},"page":"591-604","source":"Crossref","is-referenced-by-count":30,"title":["Secure Multiset Intersection Cardinality and its Application to Jaccard Coefficient"],"prefix":"10.1109","volume":"13","author":[{"given":"Bharath K.","family":"Samanthula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"ref38","year":"1999"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.165464"},{"key":"ref36","author":"samanthula","year":"2014"},{"key":"ref35","first-page":"104","article-title":"On secure scalar product computation for privacy-preserving data mining","author":"goethals","year":"0","journal-title":"Proc 7th Annu Int Conf Inf Security Cryptol"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref40","first-page":"1","article-title":"Interest-driven private friend recommendation","volume":"27","author":"samanthula","year":"2013","journal-title":"Knowl Inform Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1609956.1609965"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335438"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0019-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864745"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315306"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0175-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081956"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22348-8_19"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01835-0","author":"naumann","year":"2010","journal-title":"An Introduction to Duplicate Detection"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458275"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq067"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.121"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref20","article-title":"Espresso: Efficient privacy-preserving evaluation of sample set similarity","volume":"abs 1111 5062","author":"blundo","year":"2011","journal-title":"CoRR"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"ref21","first-page":"257","article-title":"Fairplaymp: A system for secure multi-party computation","author":"ben-david","year":"0","journal-title":"Proc 15th ACM Conf Comput Commun Security"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"ref23","first-page":"15","article-title":"Sepia: Privacy-preserving aggregation of multi-domain network events and statistics","author":"burkhart","year":"0","journal-title":"Proc 19th USENIX Conf Security"},{"key":"ref26","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","author":"huang","year":"0","journal-title":"Proc Symp Netw Distrib Syst Security"},{"key":"ref25","first-page":"35","article-title":"Faster secure two-party computation using garbled circuits","author":"huang","year":"0","journal-title":"Proc 20th USENIX Conf Secur"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/8858\/7557096\/7065287-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/7557096\/07065287.pdf?arnumber=7065287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T23:30:33Z","timestamp":1691537433000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7065287\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,1]]},"references-count":41,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2015.2415482","relation":{},"ISSN":["1545-5971"],"issn-type":[{"value":"1545-5971","type":"print"}],"subject":[],"published":{"date-parts":[[2016,9,1]]}}}