{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:22:30Z","timestamp":1725578550150},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"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":[[2021,12,13]]},"DOI":"10.1109\/pst52912.2021.9647827","type":"proceedings-article","created":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T16:08:01Z","timestamp":1640102881000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Practical Oblivious Cloud Storage System based on TEE and Client Gateway"],"prefix":"10.1109","author":[{"given":"Wensheng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_27"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_46"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046680"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382229"},{"key":"ref14","article-title":"Oblivious ram with o((log n)³) worst-case cost","author":"shi","year":"2011","journal-title":"Proc ASIACRYPT"},{"key":"ref15","article-title":"Towards practical oblivious ram","author":"stefanov","year":"2011","journal-title":"Proc NDSS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39077-7_1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813701"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2018.23239"},{"journal-title":"ARM TrustZone Technology","year":"2021","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3374664.3375749"},{"journal-title":"Enclave-based oblivious ram using intel’s sgx","year":"2020","author":"rachid","key":"ref5"},{"key":"ref8","article-title":"Towards a theory of software protection and simulationon oblivious rams","author":"goldreich","year":"1987","journal-title":"Proc SIGACT STOC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2019.8802848"},{"key":"ref2","first-page":"1","article-title":"Intelsgxexplained","author":"costan","year":"2016","journal-title":"IACR Cryptology ePrint"},{"key":"ref9","article-title":"Mapreduce parallel cuckoo hashing and oblivious ram simulations","author":"goodrich","year":"2010","journal-title":"Proc CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2699026.2699117"},{"key":"ref22","article-title":"Onion oram: A constant bandwidth blowup oblivious ram","author":"devadas","year":"2015","journal-title":"Proc Theory of Cryptography Conference"},{"key":"ref21","article-title":"Oblivious parallel ram: Improved efficiency and generic constructions","author":"chen","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516673"},{"key":"ref23","article-title":"Burst oram: Minimizing oram response times for bursty access patterns","author":"dautrich","year":"2014","journal-title":"Proc Usenix Security"},{"key":"ref25","article-title":"S3oram: A computation-efficient and constant client bandwidth blowup oram with shamir secret sharing","author":"hoang","year":"2017","journal-title":"Proc CCS"}],"event":{"name":"2021 18th International Conference on Privacy, Security and Trust (PST)","start":{"date-parts":[[2021,12,13]]},"location":"Auckland, New Zealand","end":{"date-parts":[[2021,12,15]]}},"container-title":["2021 18th International Conference on Privacy, Security and Trust (PST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9647713\/9647738\/09647827.pdf?arnumber=9647827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:59:51Z","timestamp":1652187591000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9647827\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/pst52912.2021.9647827","relation":{},"subject":[],"published":{"date-parts":[[2021,12,13]]}}}