Skip to main content
SpringerLink
Log in

Data-Oblivious Graph Algorithms in Outsourced External Memory

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8881))

Abstract

Motivated by privacy preservation for outsourced data, data-oblivious external memory is a computational framework where a client performs computations on data stored at a semi-trusted server in a way that does not reveal her data to the server. We give new efficient data-oblivious algorithms in the outsourced external memory model for a number of fundamental graph problems.

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

Notes

  1. 1.

    Thoughout this paper we measure time in terms of I/Os with the server.

References

  1. Blanton, M., Steele, A., Aliasgari, M.: Data-oblivious graph algorithms for secure computation and outsourcing. In: ASIACCS, pp. 207–218 (2013)

    Google Scholar 

  2. Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 139–149 (1995)

    Google Scholar 

  3. Damgård, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious ram without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144–163. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Emil Stefanov, E.S., Song, D.: Towards practical oblivious RAM. In: Sion, R. (ed.) NDSS 2012 (2012)

    Google Scholar 

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

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 576–587. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: CCSW, pp. 95–100 (2011)

    Google Scholar 

  9. Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Practical oblivious storage. In: CODASPY, pp. 13–24 (2012)

    Google Scholar 

  10. Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: Symposium on Discrete Algorithms (SODA), pp. 157–167 (2012)

    Google Scholar 

  11. Goodrich, M.T., Ohrimenko, O., Tamassia, R.: Graph drawing in the cloud: privately visualizing relational data using small working storage. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 43–54. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Goodrich, M.T., Simons, J.: Data-oblivious graph algorithms in outsourced external memory. ArXiv 1409.0597 (2014). http://arxiv.org/abs/1409.0597

  13. Maon, Y., Schieber, B., Vishkin, U.: Parallel ear decomposition search (EDS) and st-numbering in graphs. Theor. Comput. Sci. 47(3), 277–298 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  14. Mareš, M.: Two linear time algorithms for MST on minor closed graph classes. Arch. Math. (Brno) 40(3), 315–320 (2004)

    MATH  MathSciNet  Google Scholar 

  15. Miller, G.L., Reif, J.H.: Parallel tree contraction and its application. In: FOCS, pp. 478–489 (1985)

    Google Scholar 

  16. Schieber, B., Vishkin, U.: On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput. 17(6), 1253–1262 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  17. Stefanov, E., van Dijk, M., Shi, E., Fletcher, C.W., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious RAM protocol. IACR Cryptology ePrint Archive 2013, p. 280 (2013)

    Google Scholar 

  18. Stefanov, E., Shi, E.: Oblivistore: high performance oblivious cloud storage. In: IEEE Security and Privacy, pp. 253–267 (2013)

    Google Scholar 

  19. Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14(4), 862–874 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  20. Vishkin, U.: On efficient parallel strong orientation. Inf. Process. Lett. 20(5), 235–240 (1985)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Irvine, USA

    Michael T. Goodrich & Joseph A. Simons

Authors
  1. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph A. Simons
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael T. Goodrich .

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, Jinhua, Zhejiang, China

    Zhao Zhang

  2. University of Texas, Tyler, Texas, USA

    Lidong Wu

  3. University of Texas, Dallas, Texas, USA

    Wen Xu

  4. University of Texas, Dallas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Goodrich, M.T., Simons, J.A. (2014). Data-Oblivious Graph Algorithms in Outsourced External Memory. In: Zhang, Z., Wu, L., Xu, W., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science(), vol 8881. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12691-3_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12690-6

  • Online ISBN: 978-3-319-12691-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation