Practical oblivious storage

CODASPY'12 - Proceedings of the 2nd ACM Conference on Data and Application Security and Privacy

Volumn , Issue , 2012, Pages 13-24

  Goodrich, Michael T ^a   Mitzenmacher, Michael ^b   Ohrimenko, Olga ^c   Tamassia, Roberto ^c  

^a Irvine   (United States)

^b HARVARD UNIVERSITY   (United States)

^c Brown Univerity   (United States)

Author keywords

cloud computing; private information retrieval

Indexed keywords

CLOUD STORAGE; PRIVACY-PRESERVING TECHNIQUES; SENSITIVE DATA;

CLOUD STORAGES; CLOUD-COMPUTING; DATA ACCESS; DATA OUTSOURCING; DATA SET; HIGH PROBABILITY; PRIVACY PRESERVING; PRIVATE INFORMATION RETRIEVAL; REAL-WORLD; SENSITIVE DATAS;

ECONOMIC AND SOCIAL EFFECTS;

EID: 84869401018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2133601.2133604     Document Type: Conference Paper

References (23)

1. M. Ajtai. Oblivious RAMs without cryptographic assumptions. In Proc. ACM Symp. on Theory of Computing (STOC), pages 181-190. ACM, 2010.
2. Amazon. Amazon S3 Service. http://aws. amazon. com/s3-sla/.
3. Y. Arbitman, M. Naor, and G. Segev. De-amortized cuckoo hashing: Provable worst-case performance and experimental results. In Proc. Int. Conf. Automata, Languages and Programming (ICALP), pages 107-118. Springer, 2009.
4. D. Boneh, D. Mazifieres, and R. A. Popa. Remote oblivious storage: Making oblivious RAM practical. Technical report, CSAIL, MIT, 2011. http://dspace. mit. edu/handle/1721. 1/62006.
5. S. Chen, R. Wang, X. Wang, and K. Zhang. Side-channel leaks in Web applications: A reality today, a challenge tomorrow. In Proc. IEEE Symp. on Security and Privacy, pages 191-206, 2010.
6. I. Damgard, S. Meldgaard, and J. B. Nielsen. Perfectly secure oblivious RAM without random oracles. In Proc. Theory of Cryptography Conference (TCC), pages 144-163, 2011.
7. D. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York, NY, USA, 2009.
8. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. J. ACM, 43 (3): 431-473, 1996.
9. M. T. Goodrich and M. Mitzenmacher. Privacy-preserving access of outsourced data via oblivious RAM simulation. In Proc. Int. Colloq. on Automata, Languages and Programming (ICALP), pages 576-587, 2011.
10. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Oblivious RAM simulation with efficient worst-case access overhead. In Proc. ACM Workshop on Cloud Computing Security (CCSW), pages 95-100, 2011.
11. M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Privacy-preserving group data access via stateless oblivious RAM simulation. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2012. To appear. Preliminary version in http://arxiv. org/abs/1105. 4125.
12. A. Kirsch, M. Mitzenmacher, and U. Wieder. More robust hashing: cuckoo hashing with a stash. SIAM J. Comput., 39: 1543-1561, 2009.
13. D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 3rd edition, 1998.
14. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2012. To appear. Prelim-inary version in http://eprint. iacr. org/2011/327.
15. Microsoft Corp. Windows Azure. http://www. microsoft. com/windowsazure.
16. R. Pagh and F. Rodler. Cuckoo hashing. Journal of Algorithms, 52: 122-144, 2004.
17. B. Pinkas and T. Reinman. Oblivious RAM revis-ited. In T. Rabin, editor, Advances in Cryptology (CRYPTO), volume 6223 of LNCS, pages 502-519. Springer, 2010.
18. N. Pippenger and M. J. Fischer. Relations among complexity measures. J. ACM, 26 (2): 361-381, 1979.
19. E. Shi, T.-H. H. Chan, E. Stefanov, and M. Li. Obliv-ious RAM with O ((logN)3) worst-case cost. In Proc. ASIACRYPT, pages 197-214, 2011.
20. E. Stefanov, E. Shi, and D. Song. Towards Practical Oblivious RAM. In Proc. Network and Distributed System Security Symposium (NDSS), 2012. To appear. Preliminary version in http://arxiv. org/abs/1106. 3652.
21. J. S. Vitter. External sorting and permuting. In M.-Y. Kao, editor, Encyclopedia of Algorithms. Springer, 2008.
22. P. Williams and R. Sion. Usable PIR. In Proc. Network and Distributed System Security Symposium (NDSS), 2008.
23. P. Williams, R. Sion, and B. Carbunar. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In ACM Conference on Computer and Communications Security (CCS), pages 139-148, 2008.