{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:34:43Z","timestamp":1740141283650,"version":"3.37.3"},"reference-count":76,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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-1855391"],"award-info":[{"award-number":["CNS-1855391"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01HG006844","RM1HG009034"],"award-info":[{"award-number":["R01HG006844","RM1HG009034"]}],"id":[{"id":"10.13039\/100000002","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":[[2020]]},"DOI":"10.1109\/tdsc.2020.2965111","type":"journal-article","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T21:10:52Z","timestamp":1578604252000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["Lucene-P2: A Distributed Platform for Privacy-Preserving Text-based Search"],"prefix":"10.1109","author":[{"given":"Nitish","family":"Uplavikar","sequence":"first","affiliation":[]},{"given":"Bradley A.","family":"Malin","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2364027"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301277"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref70","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Proc 19th Annu Netw Distrib Syst Secur Symp"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0699-6"},{"key":"ref74","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Found Trends Theoretical Comput Sci"},{"key":"ref39","article-title":"On databanks and privacy homomorphism","author":"rivest","year":"1978","journal-title":"Foundations of Secure Computation"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"ref38","first-page":"353","article-title":"Highly-scalable searchable symmetric encryption with support for boolean queries","author":"cash","year":"2013","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CCIS.2011.6045073"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195784"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_18"},{"key":"ref30","article-title":"Privacy-preserving logarithmic-time search on encrypted data in cloud","author":"lu","year":"2012","journal-title":"Proc 19th Annu Netw Distrib Syst Secur Symp"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2011.155"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.23"},{"year":"0","key":"ref60"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref63","first-page":"313","author":"hazay","year":"2012","journal-title":"Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0245-7"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.43"},{"key":"ref27","first-page":"389","author":"juarez","year":"2015","journal-title":"DisPA An Intelligent Agent for Private Web Search"},{"key":"ref65","article-title":"Obliv-C: A language for extensible data-oblivious computation","volume":"2015","author":"zahur","year":"2015","journal-title":"IACR Cryptology ePrint"},{"key":"ref66","article-title":"Faster secure two-party computation using garbled circuits","author":"huang","year":"2011","journal-title":"Proc 20th USENIX Conf Secur Symp"},{"key":"ref29","article-title":"ML confidential: Machine learning on encrypted data","volume":"2012","author":"graepel","year":"2012","journal-title":"IACR Cryptology ePrint"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22633-5_5"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935306"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.34"},{"year":"2016","key":"ref2"},{"first-page":"31","year":"1995","author":"parliament","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148243"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0175-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22348-8_19"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2994620.2994633"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497482"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-015-9256-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.43"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9040-7"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1197\/jamia.M2444"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4108"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TKDE.2006.14","article-title":"Random projection-based multiplicative data perturbation for privacy preserving distributed data mining","volume":"18","author":"liu","year":"2006","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref55","first-page":"100","article-title":"Introduction to information retrieval","volume":"16","author":"manning","year":"2010","journal-title":"Natural Lang Eng"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071.019"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1108\/eb046814"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00799-004-0079-7"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1985.10024"},{"key":"ref12","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proc Compression Complexity Sequences"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223855"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/331697.335176"},{"key":"ref15","first-page":"508","article-title":"SPlaT: A system for self-plagiarism detection","author":"collberg","year":"2003","journal-title":"Proc IADIS Int Conf WWW\/Internet"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.126"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11880561_10"},{"key":"ref18","article-title":"SCAM: A copy detection mechanism for digital documents","author":"shivakumar","year":"1995","journal-title":"Proc 2nd Int Conf Theory Pract Digit Libraries"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/226931.226961"},{"year":"2002","key":"ref4"},{"year":"2000","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"article-title":"Finding similar files in a large file system","year":"1993","author":"manber","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656.004"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.11.006"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276723"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046784"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384047"},{"key":"ref47","first-page":"515","article-title":"SPIN query tools for de-identified research on a humongous database","author":"mcdonald","year":"2005","journal-title":"Proc AMIA Annu Symp"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref44","first-page":"314","article-title":"An oblivious transfer protocol with log-squared total communication","author":"lipmaa","year":"2005","journal-title":"Proc 8th Inf Secur Conf"},{"key":"ref43","first-page":"402","article-title":"Computationally private information retrieval with polylog communication","author":"cachin","year":"1999","journal-title":"Proc Annu Int Conf Theory Appl Cryptogr Techn"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/4358699\/08954811.pdf?arnumber=8954811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:28Z","timestamp":1649443888000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8954811\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":76,"URL":"https:\/\/doi.org\/10.1109\/tdsc.2020.2965111","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":[[2020]]}}}