Skip to main content
Conference Proceedings

The Melbourne shuffle: Improving oblivious storage in the cloud

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8573 LNCS(PART 2) 556-567
DOI: 10.1007/978-3-662-43951-7_47
36Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

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. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Ohrimenko, O., Goodrich, M. T., Tamassia, R., & Upfal, E. (2014). The Melbourne shuffle: Improving oblivious storage in the cloud. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8573 LNCS, pp. 556–567). Springer Verlag. https://doi.org/10.1007/978-3-662-43951-7_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free