The Melbourne Shuffle: Secure Oblivious Storage in the Cloud

Monday, March 16, 2015 - 2:00pm - 2:40pm
Klaus 2443
Eli Upfal (Brown University)
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. (Joint work with O. Ohrimenko, M. T. Goodrich, and R, Tamassia)