{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T00:01:34Z","timestamp":1755993694902,"version":"3.44.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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,6]]},"DOI":"10.1109\/cns.2019.8802848","type":"proceedings-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T13:55:11Z","timestamp":1566482111000},"page":"37-45","source":"Crossref","is-referenced-by-count":1,"title":["Efficient and Accountable Oblivious Cloud Storage with Three Servers"],"prefix":"10.1109","author":[{"given":"Qiumao","family":"Ma","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134090"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"ref13","article-title":"Simple and Efficient Two-Server ORAM","author":"wang","year":"0","journal-title":"Proc ASIACRYPT"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813649"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref3","article-title":"Towards practical oblivious RAM","author":"stefanov","year":"0","journal-title":"Proc NDSS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39077-7_1"},{"key":"ref5","article-title":"Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns","author":"dautrich","year":"0","journal-title":"Proc 23rd USENIX Security Symposium"},{"key":"ref8","article-title":"Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM","author":"ren","year":"0","journal-title":"IACR Cryptology EPrint Archive 2014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516673"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"journal-title":"Cloud storage market-forecasts from 2017 to 2022","year":"2017","key":"ref1"},{"key":"ref9","article-title":"Oblivious RAM with O((log N)3) worst-case cost","author":"shi","year":"0","journal-title":"Proc ASIACRYPT"}],"event":{"name":"2019 IEEE Conference on Communications and Network Security (CNS)","start":{"date-parts":[[2019,6,10]]},"location":"Washington, DC, USA","end":{"date-parts":[[2019,6,12]]}},"container-title":["2019 IEEE Conference on Communications and Network Security (CNS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8790401\/8802631\/08802848.pdf?arnumber=8802848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:39:33Z","timestamp":1755909573000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8802848\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cns.2019.8802848","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}