2000 character limit reached
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (1402.5524v1)
Published 22 Feb 2014 in cs.CR, cs.DC, and cs.DS
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.