{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:26:58Z","timestamp":1768825618916,"version":"3.49.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","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"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472357"],"award-info":[{"award-number":["61472357"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61571063"],"award-info":[{"award-number":["61571063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tifs.2018.2866321","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T18:41:12Z","timestamp":1534876872000},"page":"789-802","source":"Crossref","is-referenced-by-count":89,"title":["Passive Attacks Against Searchable Encryption"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7165-398X","authenticated-orcid":false,"given":"Jianting","family":"Ning","sequence":"first","affiliation":[]},{"given":"Jia","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Kaitai","family":"Liang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6087-8243","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ee-Chien","family":"Chang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847976"},{"key":"ref32","first-page":"707","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","author":"zhang","year":"2016","journal-title":"Proc Usenix Secur Symp"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2401036"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195784"},{"key":"ref10","first-page":"353","article-title":"Highly-scalable searchable symmetric encryption with support for Boolean queries","author":"cash","year":"2013","journal-title":"Advances in CryptologyCRYPTO'97"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364125"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref13","first-page":"123","article-title":"Rich queries on encrypted data: Beyond exact matches","author":"faber","year":"2015","journal-title":"Computers and Security"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2780885"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_5"},{"key":"ref16","first-page":"563","article-title":"TWORAM: Efficient oblivious RAM in two rounds with applications to searchable encryption","author":"garg","year":"2016","journal-title":"Adv Cryptology"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref18","first-page":"31","article-title":"Secure conjunctive keyword search over encrypted data","author":"golle","year":"2004","journal-title":"Proc ACNS"},{"key":"ref19","first-page":"12","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","volume":"20","author":"islam","year":"2012","journal-title":"Proc NDSS"},{"key":"ref28","first-page":"44","article-title":"Practical techniques for searches on encrypted data","author":"song","year":"2000","journal-title":"Proc IEEE Symp Secur Privacy"},{"key":"ref4","first-page":"50","article-title":"Public key encryption that allows PIR queries","author":"boneh","year":"2007","journal-title":"Adv Cryptology"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1108\/00330330610681286"},{"key":"ref3","first-page":"506","article-title":"Public key encryption with keyword search","author":"boneh","year":"2004","journal-title":"Proc EUROCRYPT"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/2636328","article-title":"A survey of provably secure searchable encryption","volume":"47","author":"b\u00f6sch","year":"2015","journal-title":"ACM Comput Surv"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.34"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.45"},{"key":"ref7","first-page":"1","article-title":"Error-tolerant searchable encryption","author":"bringer","year":"2009","journal-title":"Proc ICC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9006-6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref1","year":"2017","journal-title":"Enron Email Dataset"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484345"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CCIS.2011.6045073"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"ref24","first-page":"668","article-title":"The fallacy of composition of oblivious RAM and searchable encryption","author":"naveed","year":"2015"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.11.021"},{"key":"ref26","first-page":"250","article-title":"Secure two-party computation is practical","author":"pinkas","year":"2009","journal-title":"Proc ASIACRYPT"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.47"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8439094\/08443434.pdf?arnumber=8443434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:59:15Z","timestamp":1657745955000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8443434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":33,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2018.2866321","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}