arXiv · 1402.5524
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
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.
Explore related subjects
Keep this discovery
Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal. 2014-02-22. The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. https://arxiv.org/abs/1402.5524
Cite the original work for its findings. Save a collection to share your selection of sources.