Practicing Oblivious access on cloud storage: The gap, the fallacy, and the new way forward

Proceedings of the ACM Conference on Computer and Communications Security

Volumn 2015-October, Issue , 2015, Pages 837-849

  Bindschaedler, Vincent ^a   Naveed, Muhammad ^a   Pan, Xiaorui ^b   Wang, XiaoFeng ^b   Huang, Yan ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Access pattern; Oblivious Cloud Storage; Oblivious RAM; ORAM

Indexed keywords

RANDOM ACCESS STORAGE;

ACCESS PATTERNS; BANDWIDTH OVERHEADS; CLOUD SERVICES; CLOUD STORAGES; ORAM; REAL APPLICATIONS; REALISTIC APPLICATIONS; THEORY AND PRACTICE;

CARBON CAPTURE;

EID: 84954099286     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2810103.2813649     Document Type: Conference Paper

References (25)

1. D. Boneh, D. Mazieres, and R. Popa. Remote Oblivious Storage: Making Oblivious RAM Practical. 2011.
2. K. Chung, Z. Liu, and R. Pass. Statistically-Secure ORAM with Õ(log2 n) Overhead. ASIACRYPT, 2014.
3. J. Dautrich, E. Stefanov, and E. Shi. Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns. In USENIX Security, volume 14, 2014.
4. 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.
5. O. Goldreich and R. Ostrovsky. Software Protection and Simulation on Oblivious RAMs. Journal of the ACM, 1996.
6. M. T. Goodrich. Randomized Shellsort: A Simple Oblivious Sorting Algorithm. In SODA, 2010.
7. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. In CCSW, 2011.
8. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Practical Oblivious Storage. In CODASPY, 2012.
9. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (In)security of Hash-Based Oblivious RAM and a new Balancing Scheme. In SODA, 2012.
10. M. Maas, E. Love, E. Stefanov, M. Tiwari, E. Shi, K. Asanovic, J. Kubiatowicz, and D. Song. PHANTOM: Practical Oblivious Computation in a Secure Processor. In CCS, 2013.
11. T. Mayberry, E.-O. Blass, and A. H. Chan. Efficient Private File Retrieval by Combining ORAM and PIR. In NDSS, 2014.
12. R. McDougall. Filebench Tutorial. 2004.
13. T. Moataz, T. Mayberry, and E. Blass. Resizable Tree-Based Oblivious RAM. IACR ePrint, 2014.
14. T. Moataz, T. Mayberry, and E.-O. Blass. Constant Communication ORAM with Small Blocksize. In CCS, 2015.
15. O. Ohrimenko, M. T. Goodrich, R. Tamassia, and E. Upfal. The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. In ALP. 2014.
16. B. Pinkas and T. Reinman. Oblivious RAM Revisited. In CRYPTO, 2010.
17. 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.
18. S. Shepler, E. Kustarz, and A. Wilson. Filebench. http://sourceforge.net/projects/filebench/, 2015.
19. E. Shi, T.-H. H. Chan, E. Stefanov, and M. Li. Oblivious RAM with o((log n)3) Worst-Case Cost. In ASIACRYPT, 2011.
20. E. Stefanov and E. Shi. ObliviStore: High Performance Oblivious Cloud Storage. In S&P, 2013.
21. E. Stefanov, E. Shi, and D. X. Song. Towards Practical Oblivious RAM. In NDSS, 2012.
22. E. Stefanov, M. Van Dijk, E. Shi, C. Fletcher, L. Ren, X. Yu, and S. Devadas. Path ORAM: An Extremely Simple Oblivious RAM Protocol. In CCS, 2013.
23. X. S. Wang, T.-H. H. Chan, and E. Shi. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. IACR ePrint, 2014.
24. P. Williams and R. Sion. Single Round Access Privacy on Outsourced Storage. In CCS, 2012.
25. P. Williams, R. Sion, and A. Tomescu. PrivateFS: A Parallel Oblivious File System. In CCS, 2012.