Work

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

Year: 2014

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1402.5524

Authors: Ohrimenko, Olga, Goodrich, Michael T., Tamassia, Roberto, Upfal, Eli

Institutions: Microsoft (United States), Microsoft Research (United Kingdom), University of California, Irvine, Brown University

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Brown University, National Institutes of Health, Office of Naval Research

Awards: G2998923865, TWC: Medium: Collaborative: Privacy-Preserving Distributed Storage and Computation, G4154686922, TC: Large: Collaborative Research: Towards Trustworthy Interactions in the Cloud, TWC: Medium: Collaborative: Privacy-Preserving Distributed Storage and Computation, TC:Large:Collaborative Research: Towards Trustworthy Interactions in the Cloud, G8876996369

OpenAlex ID: W2949898336

Cites: 20

Cited by: 6

Related to: 20