The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal · arXiv (Cornell University) · 2014
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.