Skip to main content
SpringerLink
Log in

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

  • Conference paper
Information Security Applications (WISA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9503))

Included in the following conference series:

Abstract

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\).

K. Sumongkayothin–This study is partly supported by Grant-in-Aid for Scientific Research (C) (5K00183) and (15K00189) and Grant-in-Aid for Young Scientists (15K16004).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Boneh, D., Mazieres, D., Popa, R.A.: Remote oblivious storage: Making oblivious RAM practical (2011)

    Google Scholar 

  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 2014

    Google Scholar 

  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)

    Chapter  Google Scholar 

  4. Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM (JACM) 43(3), 431–473 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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. 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)

    Article  Google Scholar 

  9. Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 502–519. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  12. Sion, R., Williams, P.: Fast oblivious storage. Assoc. Comput. Mach. 15(4), 1–28 (2013)

    Google Scholar 

  13. Stefanov, E., Shi, E.: ObliviStore: high performance oblivious cloud storage, pp. 253–267. IEEE, May 2013

    Google Scholar 

  14. Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. arXiv preprint (2011). arxiv:1106.3652

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Japan Advance Institute of Science and Technology (JAIST), Nomi, Japan

    Atsuko Miyaji, Chunhua Su & Karin Sumongkayothin

  2. Japan Science and Technology Agency (JST) CREST, Tokyo, Japan

    Atsuko Miyaji

  3. Graduate School of Engineering, Osaka University, Suita, Japan

    Atsuko Miyaji

  4. Sirindhorn International Institute of Technology (SIIT), Thammasat University, Bangkok, Thailand

    Steven Gordon & Karin Sumongkayothin

Authors
  1. Steven Gordon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atsuko Miyaji
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chunhua Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Karin Sumongkayothin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karin Sumongkayothin .

Editor information

Editors and Affiliations

  1. Pusan National University, Busan, Korea (Republic of)

    Ho-won Kim

  2. Electronics and Telecommunications Research Institute, Daejeon, Korea (Republic of)

    Dooho Choi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gordon, S., Miyaji, A., Su, C., Sumongkayothin, K. (2016). M-ORAM: A Matrix ORAM with Log N Bandwidth Cost. In: Kim, Hw., Choi, D. (eds) Information Security Applications. WISA 2015. Lecture Notes in Computer Science(), vol 9503. Springer, Cham. https://doi.org/10.1007/978-3-319-31875-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31875-2_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31874-5

  • Online ISBN: 978-3-319-31875-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation