{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T16:09:12Z","timestamp":1765728552197,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,12]],"date-time":"2015-10-12T00:00:00Z","timestamp":1444608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1117106, 1223477, 1223495, 1408874, 1464113"],"award-info":[{"award-number":["CNS-1117106, 1223477, 1223495, 1408874, 1464113"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,10,12]]},"DOI":"10.1145\/2810103.2813649","type":"proceedings-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T15:22:12Z","timestamp":1444144932000},"page":"837-849","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Practicing Oblivious Access on Cloud Storage"],"prefix":"10.1145","author":[{"given":"Vincent","family":"Bindschaedler","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}]},{"given":"Muhammad","family":"Naveed","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}]},{"given":"Xiaorui","family":"Pan","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, Bloomington, IN, USA"}]},{"given":"XiaoFeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, Bloomington, IN, USA"}]},{"given":"Yan","family":"Huang","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, Bloomington, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Remote Oblivious Storage: Making Oblivious RAM Practical","author":"Boneh D.","year":"2011","unstructured":"D. Boneh , D. Mazieres , and R. A. Popa . Remote Oblivious Storage: Making Oblivious RAM Practical . 2011 . D. Boneh, D. Mazieres, and R. A. Popa. Remote Oblivious Storage: Making Oblivious RAM Practical. 2011."},{"key":"e_1_3_2_1_2_1","volume-title":"ASIACRYPT","author":"Chung K.","year":"2014","unstructured":"K. Chung , Z. Liu , and R. Pass . Statistically-Secure ORAM with \u00d8(log2 n) Overhead . ASIACRYPT , 2014 . K. Chung, Z. Liu, and R. Pass. Statistically-Secure ORAM with \u00d8(log2 n) Overhead. ASIACRYPT, 2014."},{"key":"e_1_3_2_1_3_1","volume-title":"USENIX Security","volume":"14","author":"Dautrich J.","year":"2014","unstructured":"J. Dautrich , E. Stefanov , and E. Shi . Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns . In USENIX Security , volume 14 , 2014 . J. Dautrich, E. Stefanov, and E. Shi. Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns. In USENIX Security, volume 14, 2014."},{"key":"e_1_3_2_1_4_1","volume-title":"Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE). IACR ePrint","author":"Devadas S.","year":"2015","unstructured":"S. Devadas , M. van Dijk , C. W. Fletcher , and L. Ren . Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE). IACR ePrint , 2015 . S. Devadas, M. van Dijk, C. W. Fletcher, and L. Ren. Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE). IACR ePrint, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_6_1","volume-title":"SODA","author":"Goodrich M. T.","year":"2010","unstructured":"M. T. Goodrich . Randomized Shellsort : A Simple Oblivious Sorting Algorithm . In SODA , 2010 . M. T. Goodrich. Randomized Shellsort: A Simple Oblivious Sorting Algorithm. In SODA, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046680"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133604"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095129"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23033"},{"key":"e_1_3_2_1_12_1","unstructured":"R. McDougall. Filebench Tutorial. 2004.  R. McDougall. Filebench Tutorial. 2004."},{"key":"e_1_3_2_1_13_1","volume-title":"Resizable Tree-Based Oblivious RAM. IACR ePrint","author":"Moataz T.","year":"2014","unstructured":"T. Moataz , T. Mayberry , and E. Blass . Resizable Tree-Based Oblivious RAM. IACR ePrint , 2014 . T. Moataz, T. Mayberry, and E. Blass. Resizable Tree-Based Oblivious RAM. IACR ePrint, 2014."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813701"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_47"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881447"},{"key":"e_1_3_2_1_17_1","volume-title":"USENIX Security","author":"Ren L.","year":"2015","unstructured":"L. Ren , C. W. Fletcher , A. Kwon , E. Stefanov , E. Shi , M. van Dijk , and S. Devadas . Constants Count: Practical Improvements to Oblivious RAM . In USENIX Security , 2015 . L. Ren, C. W. Fletcher, A. Kwon, E. Stefanov, E. Shi, M. van Dijk, and S. Devadas. Constants Count: Practical Improvements to Oblivious RAM. In USENIX Security, 2015."},{"key":"e_1_3_2_1_18_1","unstructured":"S. Shepler E. Kustarz and A. Wilson. Filebench. http:\/\/sourceforge.net\/projects\/filebench\/ 2015.  S. Shepler E. Kustarz and A. Wilson. Filebench. http:\/\/sourceforge.net\/projects\/filebench\/ 2015."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"e_1_3_2_1_21_1","volume-title":"NDSS","author":"Stefanov E.","year":"2012","unstructured":"E. Stefanov , E. Shi , and D. X. Song . Towards Practical Oblivious RAM . In NDSS , 2012 . E. Stefanov, E. Shi, and D. X. Song. Towards Practical Oblivious RAM. In NDSS, 2012."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_23_1","volume-title":"Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. IACR ePrint","author":"Wang X. S.","year":"2014","unstructured":"X. S. Wang , T.-H. H. Chan , and E. Shi . Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. IACR ePrint , 2014 . X. S. Wang, T.-H. H. Chan, and E. Shi. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. IACR ePrint, 2014."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382229"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"}],"event":{"name":"CCS'15: The 22nd ACM Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Denver Colorado USA","acronym":"CCS'15"},"container-title":["Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2810103.2813649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2810103.2813649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:24Z","timestamp":1750225704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2810103.2813649"}},"subtitle":["the Gap, the Fallacy, and the New Way Forward"],"short-title":[],"issued":{"date-parts":[[2015,10,12]]},"references-count":25,"alternative-id":["10.1145\/2810103.2813649","10.1145\/2810103"],"URL":"https:\/\/doi.org\/10.1145\/2810103.2813649","relation":{},"subject":[],"published":{"date-parts":[[2015,10,12]]},"assertion":[{"value":"2015-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}