Skip to main content
SpringerLink
Log in

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

  • Conference paper
Automata, Languages, and Programming (ICALP 2014)

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

Included in the following conference series:

Abstract

We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can be used to improve previous oblivious storage solutions for network-based outsourcing of data.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M., Komlós, J., Szemerédi, E.: An O(n logn) sorting network. In: ACM Symp on Theory of Computing (STOC), pp. 1–9 (1983)

    Google Scholar 

  2. Aldous, D., Diaconis, P.: Shuffling cards and stopping times. The American Mathematical Monthly 93(5), 333–348 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. Batcher, K.E.: Sorting networks and their applications. In: Proc. 1968 Spring Joint Computer Conf., pp. 307–314. AFIPS Press (1968)

    Google Scholar 

  4. Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: ACM Symp. on Theory of Computing. pp. 182–194 (1987)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Goodrich, M.T.: Randomized Shellsort: A simple oblivious sorting algorithm. In: Proc. ACM-SIAM Sump. on Discrete Algorithms (SODA), pp. 1–16 (2010)

    Google Scholar 

  7. Goodrich, M.T.: Zig-zag Sort: A Deterministic Data-Oblivious Sorting Algorithm Running in O(nlogn) Time. In: ACM Symp. on Theory of Computing (2014)

    Google Scholar 

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

  9. Goodrich, M.T., Mitzenmacher, M.: Anonymous card shuffling and its applications to parallel mixnets. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 549–560. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: Proc. ACM Workshop on Cloud Computing Security (CCSW), pp. 95–100 (2011)

    Google Scholar 

  11. Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Practical oblivious storage. In: ACM Conf. on Data and Application Security and Privacy (CODASPY), pp. 13–24 (2012)

    Google Scholar 

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

    Google Scholar 

  13. Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS (2012)

    Google Scholar 

  14. Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Sion, R., Curtmola, R., Dietrich, S., Kiayias, A., Miret, J.M., Sako, K., Sebé, F. (eds.) RLCPS, WECSR, and WLC 2010. LNCS, vol. 6054, pp. 136–149. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Kushilevitz, E., Lu, S., Ostrovsky, R.: On the (in)security of hash-based oblivious RAM and a new balancing scheme. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 143–156 (2012)

    Google Scholar 

  16. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)

    Google Scholar 

  17. Ohrimenko, O., Goodrich, M.T., Tamassia, R., Upfal, E.: The Melbourne shuffle: Improving oblivious storage in the cloud. CoRR abs/1402.5524 (2014)

    Google Scholar 

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

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

    Chapter  Google Scholar 

  20. Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: An Extremely Simple Oblivious RAM Protocol. In: ACM Conf. on Computer and Communications Security, CCS (2013)

    Google Scholar 

  21. Stefanov, E., Shi, E., Song, D.: Towards Practical Oblivious RAM. In: Proc. Network and Distributed System Security Symposium (NDSS) (2012)

    Google Scholar 

  22. Williams, P., Sion, R.: Single round access privacy on outsourced storage. In: ACM Conf. on Computer and Communications Security, pp. 293–304 (2012)

    Google Scholar 

  23. Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In: ACM Conference on Computer and Communications Security (CCS), pp. 139–148 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research Cambridge, UK

    Olga Ohrimenko

  2. University of California, Irvine, USA

    Michael T. Goodrich

  3. Brown University, USA

    Roberto Tamassia & Eli Upfal

Authors
  1. Olga Ohrimenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberto Tamassia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eli Upfal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Boltzmannstrasse 3, 85748, München, Germany

    Javier Esparza

  2. LIAFA, Université Paris Diderot-Paris 7, Case 7014, 75205, Paris Cedex 13, France

    Pierre Fraigniaud

  3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Thore Husfeldt

  4. Department Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK,

    Elias Koutsoupias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ohrimenko, O., Goodrich, M.T., Tamassia, R., Upfal, E. (2014). The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43951-7_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43950-0

  • Online ISBN: 978-3-662-43951-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation