The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

Download Now
Provided by: University of Calgary
Topic: Cloud
Format: PDF
The authors 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. Their method can be used to improve previous oblivious storage solutions for network-based outsourcing of data. One of the unmistakable recent trends in networked computation and distributed information management is that of cloud storage, whereby users outsource data to external servers that manage and provide access to their data. Such services relieve users from the burden of backing up and having to maintain access to their data across multiple computing platforms, but, in return, such services also introduce privacy concerns.
Download Now

Find By Topic