Data-oblivious data structures

DOI10.4230/LIPICS.STACS.2014.554MaRDI QIDQ2965516zbMATH OpenOpenAlexFDO

Authors John Mitchell, Joe Zimmerman

Publication date 3 March 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2014/4487/pdf/45.pdf

zbMATH Keywords

data-oblivious algorithmsdata-oblivious data structuresoblivious RAMsecure cloud computingsecure multi-party computation

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Lower bounds for oblivious data structures
• Oblivious RAM Revisited
• scientific article; zbMATH DE number 1559561
• Foundations of differentially oblivious algorithms
• The Melbourne shuffle: improving oblivious storage in the cloud

Cited in

(19)

• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• Oblivious tight compaction in \(O(n)\) time with smaller constant
• OptORAMa: optimal oblivious RAM
• Efficient, oblivious data structures for MPC
• Data-oblivious graph algorithms in outsourced external memory
• scientific article; zbMATH DE number 1559561 (Why is no real title available?)
• Cache-oblivious and data-oblivious sorting and applications
• Codeless Data Structures and Algorithms
• Sorting Short Keys in Circuits of Size ${o(n \log n)}$
• The Melbourne shuffle: improving oblivious storage in the cloud
• Anti-persistence
• Lower bounds for oblivious data structures
• Foundations of differentially oblivious algorithms
• Data-Oblivious Stream Productivity
• Asymptotically tight bounds for composing ORAM with PIR
• 3-party distributed ORAM from oblivious set membership
• OptORAMa: Optimal oblivious RAM
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Optimal offline ORAM with perfect security via simple oblivious priority queues

This page was built for publication: Data-oblivious data structures

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