Constant communication ORAM with small blocksize

Proceedings of the ACM Conference on Computer and Communications Security

Volumn 2015-October, Issue , 2015, Pages 862-873

  Moataz, Tarik ^a   Mayberry, Travis ^b   Blass, Erik Oliver ^c  

^a Department of Ecosystem Science and Sustainability   (United States)

^b UNITED STATES NAVAL ACADEMY   (United States)

^c AIRBUS GROUP INNOVATIONS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; SECURITY OF DATA;

BLOCK SIZES; COMMUNICATION COMPLEXITY; COMMUNICATION OVERHEADS; COMPUTATION COMPLEXITY; HO-MOMORPHIC ENCRYPTIONS; LARGE BLOCKS; POLYLOGARITHMIC;

CRYPTOGRAPHY;

EID: 84954164499     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2810103.2813701     Document Type: Conference Paper

References (30)

1. D. Apon, J. Katz, E. Shi, and A. Thiruvengadam. Verifiable Oblivious Storage. In Proceedings of Public-Key Cryptography, pages 131-148, Buenos Aires, Argentina, 2014.
2. Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pages 309-325. ACM, 2012.
3. K.-M. Chung and R. Pass. A Simple ORAM. IACR Cryptology ePrint Archive, 2013:243, 2013.
4. Jean-Sébastien Coron, Tancrède Lepoint, and Mehdi Tibouchi. Scale-invariant fully homomorphic encryption over the integers. In Public-Key Cryptography-PKC 2014, pages 311-328. Springer, 2014.
5. I. Damgård, S. Meldgaard, and J.B. Nielsen. Perfectly Secure Oblivious RAM without Random Oracles. In Proceedings of Theory of Cryptography Conference -TCC, pages 144-163, Providence, USA, March 2011.
6. Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, and Daniel Wichs. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. IACR Cryptology ePrint Archive, 2015:5, 2015.
7. C. Gentry, K.A. Goldman, S. Halevi, C.S. Jutla, M. Raykova, and Daniel Wichs. Optimizing ORAM and Using It Efficiently for Secure Computation. In Proceedings of Privacy Enhancing Technologies, pages 1-18, 2013.
8. O. Goldreich. Towards a Theory of Software Protection and Simulation by Oblivious RAMs. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing -STOC, pages 182-194, New York, USA, 1987.
9. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43(3):431-473, May 1996. ISSN 0004-5411. doi: 10.1145/233551.233553. URL http://doi.acm.org/10.1145/233551.233553.
10. M.T. Goodrich and M. Mitzenmacher. Privacy-preserving access of outsourced data via oblivious ram simulation. In Proceedings of Automata, Languages and Programming -ICALP, pages 576-587, Zurick, Switzerland, 2011.
11. M.T. Goodrich, M. Mitzenmacher, Olga Ohrimenko, and Roberto Tamassia. Oblivious ram simulation with efficient worst-case access overhead. In Proceedings of the 3rd ACM Cloud Computing Security Workshop -CCSW, pages 95-100, Chicago, USA, 2011.
12. M.T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Privacy-preserving group data access via stateless oblivious RAM simulation. In Proceedings of the Symposium on Discrete Algorithms -SODA, pages 157-167, Kyoto, Japan, 2012.
13. E. Kushilevitz and R. Ostrovsky. Replication is not Needed: Single Database, Computationally-Private Information Retrieval. In Proceedings of Foundations of Computer Science, pages 364-373, Miami Beach, USA, 1997.
14. E. Kushilevitz, S. Lu, and R. Ostrovsky. On the (in)security of hash-based oblivious ram and a new balancing scheme. In Proceedings of the Symposium on Discrete Algorithms -SODA, pages 143-156, Kyoto, Japan, 2012.
15. H. Lipmaa. An Oblivious Transfer Protocol with Log-Squared Communication. In Proceedings of Information Security Conference, pages 314-328, Singapore, 2005.
16. A. López-Alt, E. Tromer, and V. Vaikuntanathan. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In Proceedings of Symposium on Theory of Computing, pages 1219-1234, 2012.
17. T. Mayberry, E.-O. Blass, and A.H. Chan. Efficient Private File Retrieval by Combining ORAM and PIR. In Proceedings of the Network and Distributed System Security Symposium, San Diego, USA, 2014.
18. T. Moataz, E.-O. Blass, and G. Noubir. Recursive Trees for Practical ORAM. In Proceedings of Privacy Enhancing Technologies Symposium, pages 115-134, Philadelphia, USA, 2015.
19. T. Moataz, T. Mayberry, E.-O. Blass, and A.H. Chan. Resizable Tree-Based Oblivious RAM. In Proceedings of Financial Cryptography and Data Security, pages 147-167, San Juan, Puerto Rico, 2015. ISBN 978-3-662-47853-0.
20. R. Ostrovsky. Efficient computation on oblivious rams. In Proceedings of the Symposium on Theory of Computing -STOC, pages 514-523, Baltimore, USA, 1990.
21. R. Ostrovsky and V. Shoup. Private information storage (extended abstract). In Proceedings of the Symposium on Theory of Computing -STOC, pages 294-303, El Paso, USA, 1997.
22. B. Pinkas and T. Reinman. Oblivious ram revisited. In Advances in Cryptology - CRYPTO, pages 502-519, Santa Barbara, USA, 2010.
23. L. Ren, C.W. Fletcher, A. Kwon, E. Stefanov, E. Shi, M. van Dijk, and S. Devadas. Constants Count: Practical Improvements to Oblivious RAM, 2014. IACR Cryptology ePrint Archive 997.
24. RightScale. State of the cloud report, 2015. URL http://assets.rightscale.com/uploads/pdfs/RightScale-2015-State-of-the-Cloud-Report.pdf.
25. E. Shi, T.-H.H. Chan, E. Stefanov, and M. Li. Oblivious RAM with O(log3(N)) Worst-Case Cost. In Proceedings of Advances in Cryptology - ASIACRYPT, pages 197-214, Seoul, South Korea, 2011. ISBN 978-3-642-25384-3.
26. E. Stefanov, E. Shi, and D.X. Song. Towards practical oblivious ram. In Proceedings of the Network and Distributed System Security Symposium, San Diego, USA, 2012. The Internet Society.
27. E. Stefanov, M. van Dijk, E. Shi, C.W. Fletcher, L. Ren, X. Yu, and S. Devadas. Path ORAM: an extremely simple oblivious RAM protocol. In Proceedings of Conference on Computer and Communications Security, pages 299-310, Berlin, Germany, 2013. ISBN 978-1-4503-2477-9.
28. P. Williams and R. Sion. Usable pir. In Proceedings of the Network and Distributed System Security Symposium, San Diego, USA, 2008.
29. 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, pages 139-148, Alexandra, USA, 2008.
30. Peter Williams, Radu Sion, and Alin Tomescu. PrivateFS: A parallel oblivious file system. In Proceedings of the 2012 ACM conference on Computer and communications security, pages 977-988. ACM, 2012.