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.
Cite
@article{arxiv.1402.5524,
title = {The Melbourne Shuffle: Improving Oblivious Storage in the Cloud},
author = {Olga Ohrimenko and Michael T. Goodrich and Roberto Tamassia and Eli Upfal},
journal= {arXiv preprint arXiv:1402.5524},
year = {2014}
}