The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

TL;DR

This paper introduces a novel, efficient, and secure data-oblivious shuffle algorithm that enhances cloud storage privacy without relying on sorting, improving existing data outsourcing solutions.

Contribution

The paper presents the first secure data-oblivious shuffle algorithm not based on sorting, advancing privacy-preserving data storage techniques.

Findings

The shuffle algorithm is simple and efficient.

It improves privacy in cloud storage solutions.

It outperforms previous sorting-based methods.

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.