The Melbourne shuffle: improving oblivious storage in the cloud

DOI10.1007/978-3-662-43951-7_47MaRDI QIDQ5167869zbMATH OpenOpenAlexFDO

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

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.5524

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

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.

Recommendations

• CacheShuffle: a family of oblivious shuffles
• Data-oblivious data structures
• Secret-shared shuffle
• Oblivious RAM Revisited
• How to Shuffle in Public

Cited in

(4)

• Data-oblivious data structures
• Practical and provably secure onion routing
• CacheShuffle: a family of oblivious shuffles
• Structured encryption and distribution-aware leakage suppression

This page was built for publication: The Melbourne shuffle: improving oblivious storage in the cloud

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167869)