Optimal offline ORAM with perfect security via simple oblivious priority queues

DOI10.4230/LIPICS.ISAAC.2024.55MaRDI QIDQ7260677zbMATH OpenFDO

Authors Thore Thießen, Jan Vahrenhold

Publication date 8 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2024.55

zbMATH Keywords

cache-oblivious algorithmexternal memory algorithmoblivious priority queueoffline ORAMperfect security

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Cache-oblivious algorithms
• Cache-oblivious and data-oblivious sorting and applications
• Cache-oblivious priority queue and graph algorithm applications
• Can we overcome the n n barrier for oblivious sorting?
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• College Admissions and the Stability of Marriage
• Data-oblivious data structures
• Data-oblivious graph algorithms in outsourced external memory
• Efficient, oblivious data structures for MPC
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• scientific article; zbMATH DE number 7788479 (Why is no real title available?)
• Is there an oblivious RAM lower bound?
• Lower bounds for oblivious data structures
• Oblivious RAM with worst-case logarithmic overhead
• Oblivious tight compaction in \(O(n)\) time with smaller constant
• OptORAMa: Optimal oblivious RAM
• Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
• Software protection and simulation on oblivious RAMs
• Time bounds for selection
• Topics in Cryptology – CT-RSA 2006
• Yes, there is an oblivious RAM lower bound!

This page was built for publication: Optimal offline ORAM with perfect security via simple oblivious priority queues

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