{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:25:53Z","timestamp":1740144353124,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"EU Project H2020 IOStack: Software-Defined Storage for Big Data","award":["644182"],"award-info":[{"award-number":["644182"]}]},{"DOI":"10.13039\/501100003400","name":"Spanish research project Software-Defined Edge Clouds through the Ministry of Science and Innovation","doi-asserted-by":"publisher","award":["TIN2016-77836-C2-1-R"],"award-info":[{"award-number":["TIN2016-77836-C2-1-R"]}],"id":[{"id":"10.13039\/501100003400","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tifs.2017.2762824","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T18:36:26Z","timestamp":1507919786000},"page":"590-604","source":"Crossref","is-referenced-by-count":5,"title":["Enhancing Tree-Based ORAM Using Batched Request Reordering"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9700-7318","authenticated-orcid":false,"given":"Marc","family":"Sanchez-Artigas","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454167"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"ref10","first-page":"415","article-title":"Constants count: Practical improvements to oblivious RAM","author":"ren","year":"2015","journal-title":"Proc Usenix Secur Symp"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_6"},{"article-title":"Asymptotically tight bounds for composing ORAM with PIR","year":"2016","author":"nayak","key":"ref12"},{"key":"ref13","first-page":"197","article-title":"Oblivious RAM with O((log \n$N)^{3})$\n worst-case cost","author":"shi","year":"2011","journal-title":"Proc ASIACRYPT"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485971"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750413"},{"article-title":"A simple recursive tree oblivious RAM","year":"2014","author":"pinkas","key":"ref16"},{"article-title":"A simple ORAM","year":"2013","author":"chung","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2013.6658650"},{"key":"ref19","first-page":"62","article-title":"Statistically-secure ORAM with Õ(log\n$^{2} n$\n) overhead","author":"chung","year":"2014","journal-title":"Proc ASIACRYPT"},{"journal-title":"Bouncy Castle Cryptography Library","year":"0","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_27"},{"journal-title":"RPyC—Remote Python Calls","year":"0","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133604"},{"key":"ref8","first-page":"199","article-title":"Shroud: Ensuring private access to large-scale data in the data center","author":"lorch","year":"2013","journal-title":"Proc FAST"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39077-7_1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452397"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2699026.2699117"},{"key":"ref1","first-page":"1","article-title":"Access pattern disclosure on searchable encryption: Ramification, attack and mitigation","author":"islam","year":"2012","journal-title":"Proc NDSS"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830787"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2996429.2996430"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2014.6835932"},{"journal-title":"Combinatorial Algorithms","year":"1975","author":"nijenhuis","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"journal-title":"Optimizing path ORAM for cloud storage applications","year":"2015","author":"wolfe","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8225765\/08067536.pdf?arnumber=8067536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:05Z","timestamp":1642004645000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8067536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2017.2762824","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}