The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
classification
💻 cs.CR
cs.DCcs.DS
keywords
shuffledata-obliviousoblivioussecurestoragealgorithmclouddata
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.