{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T16:11:05Z","timestamp":1790352665137,"version":"4.1.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8486381","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T14:45:36Z","timestamp":1539873936000},"page":"810-818","source":"Crossref","is-referenced-by-count":66,"title":["Differentially Private Access Patterns for Searchable Symmetric Encryption"],"prefix":"10.1109","author":[{"given":"Guoxing","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ten-Hwang","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref12","article-title":"Tworam: Efficient oblivious ram in two rounds with applications to searchable encryption","author":"garg","year":"2016","journal-title":"Crypto"},{"key":"ref13","article-title":"The fallacy of composition of oblivious ram and searchable encryption","author":"naveed","year":"2015","journal-title":"Cryptology EPrint Archive Report 2011"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-39077-7_5","article-title":"Broadening the scope of differential privacy using metrics","author":"chatzikokolakis","year":"2013","journal-title":"Privacy Enhancing Technologies"},{"key":"ref16","year":"0","journal-title":"Enron Dataset"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref18","author":"ostrovsky","year":"2007","journal-title":"A Survey of Single-Database Private Information Retrieval Techniques and Applications"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2557547.2557570"},{"key":"ref28","article-title":"Lower-cost epsilon-private information retrieval","author":"toledo","year":"2016","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-39884-1_22","article-title":"Parallel and dynamic searchable symmetric encryption","author":"kamara","year":"2013","journal-title":"International Conference on Financial Cryptography and Data Security"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.47"},{"key":"ref5","article-title":"Highly-scalable searchable symmetric encryption with support for boolean queries","author":"cash","year":"2013","journal-title":"Crypto"},{"key":"ref8","article-title":"Boolean searchable symmetric encryption with worst-case sub-linear complexity","author":"kamara","year":"2017","journal-title":"Eurocrypt"},{"key":"ref7","article-title":"Sophos-forward secure searchable encryption","author":"raphael","year":"2016","journal-title":"ACM CCS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref9","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"NDSS"},{"key":"ref1","article-title":"Practical techniques for searches on encrypted data","author":"song","year":"2000","journal-title":"IEEE Symposium on Security and Privacy"},{"key":"ref20","author":"kamara","year":"0","journal-title":"Clusion"},{"key":"ref22","year":"0","journal-title":"Javareedsolomon"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"ref23","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","author":"zhang","year":"2016","journal-title":"USENIX Security Symposium"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.11.021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2996429.2996432"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","location":"Honolulu, HI","start":{"date-parts":[[2018,4,16]]},"end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08486381.pdf?arnumber=8486381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T18:59:15Z","timestamp":1598209155000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8486381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8486381","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}