The Melbourne Shuffle: Improving Oblivious Storage in the Cloud
arXiv:1402.5524v176 citations
Originality Highly original
AI Analysis
This improves oblivious storage solutions for cloud data outsourcing, addressing security and performance issues in network-based systems.
The paper tackled the problem of secure data-oblivious shuffling in cloud storage by introducing a novel algorithm that avoids sorting, resulting in a simple and efficient method.
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.