M-ORAM: A Matrix ORAM with Log N Bandwidth Cost

  • Steven Gordon
  • Atsuko Miyaji
  • Chunhua Su
  • Karin SumongkayothinEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9503)


Oblivious RAM can hide a client’s access pattern from an untrusted server. However current ORAM algorithms incur large communication or storage overheads. We propose a novel ORAM construction using a matrix structure for server storage where a client downloads blocks from each row, choosing the column randomly to hide the access pattern. Both a normal and recursive construction are presented, achieving bandwidth cost of O(1) and \(O(\log N)\), respectively, and client storage similar to Path ORAM. We show under the same conditions, our matrix ORAM reduces bandwidth cost compared to Path ORAM by \(\log N \over 2\).


Binary Tree Data Block Access Pattern Server Storage Access Request 
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.


  1. 1.
    Boneh, D., Mazieres, D., Popa, R.A.: Remote oblivious storage: Making oblivious RAM practical (2011)Google Scholar
  2. 2.
    Dautrich, J., Stefanov, E., Shi, E.: Burst ORAM: Minimizing oram response times for bursty access patterns. In: 23rd USENIX Security Symposium (USENIX Security 14), pp. 749–764. USENIX Association, San Diego, 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: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 1–18. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM (JACM) 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 Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 157–167 (2012)Google Scholar
  6. 6.
    Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: NDSS, vol. 20, p. 12 (2012)Google Scholar
  7. 7.
    Karvelas, N.P., Peter, A., Katzenbeisser, S., Biedermann, S.: Efficient privacy-preserving big data processing through proxy-assisted ORAM. IACR Cryptology ePrint Archive 2014, 72 (2014)Google Scholar
  8. 8.
    Liu, C., Zhu, L., Wang, M., Tan, Y.A.: Search pattern leakage in searchable encryption: Attacks and new construction. Inf. Sci. 265, 176–188 (2014)CrossRefGoogle Scholar
  9. 9.
    Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 502–519. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Ren, L., Fletcher, C.W., Yu, X., Kwon, A., van Dijk, M., Devadas, S.: Unified oblivious-RAM: Improving recursive ORAM with locality and pseudorandomness. IACR Cryptology ePrint Archive 2014, 205 (2014)Google Scholar
  11. 11.
    Shi, E., Chan, T.-H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)\(^\text{3 }\)) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197–214. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Sion, R., Williams, P.: Fast oblivious storage. Assoc. Comput. Mach. 15(4), 1–28 (2013)Google Scholar
  13. 13.
    Stefanov, E., Shi, E.: ObliviStore: high performance oblivious cloud storage, pp. 253–267. IEEE, May 2013Google Scholar
  14. 14.
    Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. arXiv preprint (2011). arxiv:1106.3652
  15. 15.
    Stefanov, E., Van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious ram protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 299–310. ACM (2013)Google Scholar
  16. 16.
    Zhang, J., Ma, Q., Zhang, W., Qiao, D.: KT-ORAM: a bandwidth-efficient ORAM built on k-ary tree of pir nodes. Cryptology ePrint Archive, Report 2014/624 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Steven Gordon
    • 4
  • Atsuko Miyaji
    • 1
    • 2
    • 3
  • Chunhua Su
    • 1
  • Karin Sumongkayothin
    • 1
    • 4
    Email author
  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.Sirindhorn International Institute of Technology (SIIT)Thammasat UniversityBangkokThailand

Personalised recommendations