{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:13:53Z","timestamp":1763018033246},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737588","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"source":"Crossref","is-referenced-by-count":39,"title":["Hardening Database Padding for Searchable Encryption"],"prefix":"10.1109","author":[{"given":"Lei","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingliang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chungen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45744-4_8"},{"key":"ref11","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Proc NDSS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref13","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","author":"zhang","year":"2015","journal-title":"Proc USNEIX Security"},{"key":"ref14","article-title":"Thwarting leakage abuse attacks against searchable encryption – a formal approach and applications to database padding","author":"bost","year":"2017","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335388"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133980"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243782"},{"key":"ref18","article-title":"Practical Dynamic Searchable Symmetric Encryption with Small Leakage","author":"stefanov","year":"2014","journal-title":"Proc NDSS"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24177-7_3"},{"key":"ref5","article-title":"Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries","author":"cash","year":"2013","journal-title":"Proc Crypto"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2721221"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2017.7969151"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516730"},{"key":"ref1","article-title":"Practical techniques for searches on encrypted data","author":"song","year":"2000","journal-title":"Proc IEEE S&P"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.47"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/584091.584093"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486381"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580393"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.17.12.684"},{"key":"ref25","article-title":"Constrained k-means clustering with background knowledge","author":"wagstaff","year":"2001","journal-title":"Proc ICML"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737588.pdf?arnumber=8737588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:15:02Z","timestamp":1657854902000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737588","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}