Advertisement

Recursive M-ORAM: A Matrix ORAM for Clients with Constrained Storage Space

  • Karin SumongkayothinEmail author
  • Steven Gordon
  • Atsuko Miyaji
  • Chunhua Su
  • Komwut Wipusitwarakun
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 651)

Abstract

Although oblivious RAM (ORAM) can hide a client’s access pattern from an untrusted server, bandwidth and local storage requirements can be excessive. Path ORAM, Matrix ORAM and other schemes can greatly bandwidth cost, but on devices with constrained storage space they require too much local storage. We design a recursive version of Matrix ORAM, where data addresses are stored on the server instead of client, and are recursively accessed with revealing important information. We analyse our algorithm and show it keeps bandwidth, client storage and computational overhead each to \(O(\log N)\).

Keywords

Data Block Server Storage Read Operation Access Operation Storage Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Boneh, D., Mazieres, D., Popa, R.A.: Remote oblivious storage: making oblivious RAM practical. Tech. rep. MIT-CSAIL-TR-2011-018, Massachusetts Institute of Technology, March 2011. http://hdl.handle.net/1721.1/62006
  2. 2.
    Dautrich, J., Stefanov, E., Shi, E.: Burst ORAM: minimizing ORAM response times for bursty access patterns. In: Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, pp. 749–764, August 2014Google Scholar
  3. 3.
    Gentry, C., Goldman, K.A., Halevi, S., Julta, C., Raykova, M., Wichs, D.: Optimizing ORAM and using it efficiently for secure computation. In: Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 1–18. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-39077-7_1 CrossRefGoogle Scholar
  4. 4.
    Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM 43(3), 431–473 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, pp. 157–167, January 2012Google Scholar
  6. 6.
    Gordon, S., Miyaji, A., Su, C., Sumongkayothin, K.: A matrix based ORAM: design, implementation and experimental analysis. IEICE Trans. Inf. Syst. E99–D(8), 2044–2055 (2016)CrossRefGoogle Scholar
  7. 7.
    Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: Proceedings of the 19th Annual Network & Distributed System Security Symposium, San Diego, CA, February 2012Google Scholar
  8. 8.
    Karvelas, N.P., Peter, A., Katzenbeisser, S., Biedermann, S.: Efficient privacy-preserving big data processing through proxy-assisted ORAM. Proc. IACR Cryptology ePrint Archive 2014, 72 (2014)Google Scholar
  9. 9.
    Liu, C., Zhu, L., Wang, M., Tan, Y.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. Int. J. 265, 176–188 (2014)Google Scholar
  10. 10.
    Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Proceedings of the 30th Annual Cryptology Conference, Santa Barbara, CA, pp. 502–519, August 2010Google Scholar
  11. 11.
    Ren, L., Fletcher, C.W., Yu, X., Kwon, A., van Dijk, M., Devadas, S.: Unified oblivious-RAM: Improving recursive ORAM with locality and pseudorandomness. Proc. IACR Cryptology ePrint Archive 2014, 205 (2014)Google Scholar
  12. 12.
    Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197–214. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-25385-0_11 CrossRefGoogle Scholar
  13. 13.
    Stefanov, E., van Dijk, M., Shi, E., Fletcher, C.W., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, Berlin, Germany, pp. 299–310, November 2013Google Scholar
  14. 14.
    Stefanov, E., Shi, E.: Oblivistore: high performance oblivious cloud storage. In: Proceedings of the IEEE Symposium on Security and Privacy, Berkeley, CA, pp. 253–267, May 2013Google Scholar
  15. 15.
    Stefanov, E., Shi, E., Song, D.X.: Towards practical oblivious RAM. In: Proceedings of the 19th Annual Network & Distributed System Security Symposium, The Internet Society, San Diego, CA, USA, February 2012Google Scholar
  16. 16.
    Williams, P., Sion, R., Tomescu, A.: PrivateFS: a parallel oblivious file system. In: Proceedings of the ACM Conference on Computer and Communications Security, New York, NY, pp. 977–988, October 2012Google Scholar
  17. 17.
    Zhang, J., Ma, Q., Zhang, W., Qiao, D.: KT-ORAM: A Bandwidth-efficient ORAM Built on K-ary Tree of PIR Nodes. Proc. IACR Cryptology ePrint Archive 2014, 624 (2014)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2016

Authors and Affiliations

  • Karin Sumongkayothin
    • 1
    • 5
    Email author
  • Steven Gordon
    • 4
  • Atsuko Miyaji
    • 1
    • 2
    • 3
  • Chunhua Su
    • 3
  • Komwut Wipusitwarakun
    • 5
  1. 1.Japan Advance Institute of Science and Technology (JAIST)NomiJapan
  2. 2.Japan Science and Technology Agency (JST) CRESTTokyoJapan
  3. 3.Graduate School of EngineeringOsaka UniversitySuitaJapan
  4. 4.School of Engineering and TechnologyCentral Queensland UniversityRockhamptonAustralia
  5. 5.Sirindhorn International Institute of TechnologyThammasat University (SIIT)Pathum ThaniThailand

Personalised recommendations