{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:53:49Z","timestamp":1725699229909},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/milcom.2016.7795381","type":"proceedings-article","created":{"date-parts":[[2016,12,26]],"date-time":"2016-12-26T16:49:56Z","timestamp":1482770996000},"page":"527-532","source":"Crossref","is-referenced-by-count":3,"title":["TSKT-ORAM: A two-server k-ary tree ORAM for access pattern protection in cloud storage"],"prefix":"10.1109","author":[{"given":"Jinsheng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qiumao","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Wensheng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Daji","family":"Qiao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Optimizing ORAM and using it efficiently for secure computation","author":"gentry","year":"2013","journal-title":"Proc PETS"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/2508859.2516673"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2660267.2660365"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/2810103.2813701"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/2810103.2813649"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/SP.2016.20"},{"year":"2011","author":"freier","journal-title":"The Secure Sockets Layer (SSL) Protocol Version 3 0","key":"ref16"},{"key":"ref17","article-title":"Oblivious RAM with $O((\\log N)^{3})$ worst-case cost","author":"shi","year":"2011","journal-title":"Proc ASIACRYPT"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.14722\/ndss.2014.23033"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/MILCOM.2016.7795381"},{"key":"ref4","article-title":"Privacy-preserving access of outsourced data via oblivious RAM simulation","author":"goodrich","year":"2011","journal-title":"Proc ICALP"},{"key":"ref3","article-title":"Mapreduce parallel cuckoo hashing and oblivious RAM simulations","author":"goodrich","year":"2010","journal-title":"Proc CoRR"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2382196.2382299"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1137\/1.9781611973099.13"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/SP.2013.25"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/2508859.2516660"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/233551.233553"},{"key":"ref1","article-title":"Access pattern disclosure on searchable encryption: ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Proc NDSS"},{"key":"ref9","article-title":"Towards practical oblivious RAM","author":"stefanov","year":"2011","journal-title":"Proc NDSS"}],"event":{"name":"MILCOM 2016 - 2016 IEEE Military Communications Conference (MILCOM)","start":{"date-parts":[[2016,11,1]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2016,11,3]]}},"container-title":["MILCOM 2016 - 2016 IEEE Military Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7784513\/7795145\/07795381.pdf?arnumber=7795381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:42:00Z","timestamp":1513179720000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7795381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/milcom.2016.7795381","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]}}}