HackerPapers

arXiv:1402.5524cs.CR

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

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

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.CRCryptography and Security cs.DCDistributed, Parallel, and Cluster Computing cs.DSData Structures and Algorithms

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jul 2014 to Jul 2014. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.