Cache-oblivious and data-oblivious sorting and applications

MaRDI QIDQ4608037zbMATH OpenFDO

Authors T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175448

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• Data-oblivious data structures
• Foundations of differentially oblivious algorithms
• Oblivious RAM Revisited
• On the limits of cache-obliviousness
• Zig-zag sort

Cited in

(12)

• OptORAMa: optimal oblivious RAM
• OptORAMa: Optimal oblivious RAM
• Sorting and searching in the presence of memory faults (without redundancy)
• A logarithmic lower bound for oblivious RAM (for all parameters)
• scientific article; zbMATH DE number 2011837 (Why is no real title available?)
• Parameter-hiding order revealing encryption
• A logarithmic lower bound for oblivious RAM (for all Parameters)
• A theory of composition for differential obliviousness
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Efficient sorting using registers and caches
• Optimal offline ORAM with perfect security via simple oblivious priority queues
• Can we overcome the \(n\log n\) barrier for oblivious sorting?

This page was built for publication: Cache-oblivious and data-oblivious sorting and applications

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