Live briefing
Everything about Oblivious RAM
An Oblivious RAM (ORAM) simulator is a compiler that transforms an algorithm in such a way that the resulting algorithm preserves the input-output behavior of the original algorithm but the distribution of the memory access patterns of the transformed algorithm is independent of the memory access pattern of the original algorithm. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Oblivious RAMA 5-minute orientation
- Skim a recent paper: Oblivious RAM with Worst-Case Logarithmic OverheadInfluential work since 2022
- Pick up a classic book: Advances in Cryptology – EUROCRYPT 2013The most-reprinted book on the subject
- Read the landmark paper: Software protection and simulation on oblivious RAMsCited 1,167 times
- Go sideways: Oblivious data structureA closely related topic
- Go sideways: External memory algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Software protection and simulation on oblivious RAMs
Dynamic Proofs of Retrievability Via Oblivious RAM
DivORAM: Towards a practical oblivious RAM with variable block size
Oblivious RAM
Design space exploration and optimization of path oblivious RAM in secure processors
Differentially Private Oblivious RAM
OptORAMa: Optimal Oblivious RAM
Blockchain-based accountability for multi-party oblivious RAM
🆕 Influential since 2022
Oblivious RAM with Worst-Case Logarithmic Overhead
Secure Traffic Monitoring With Spatio-Temporal Metadata Protection Using Oblivious RAM
NeuralD: Detecting Indistinguishability Violations of Oblivious RAM With Neural Distinguishers
A forward and backward private oblivious RAM for storage outsourcing on edge-cloud computing
Locality-Preserving Oblivious RAM
📚 Books worth reading
Advances in Cryptology – EUROCRYPT 2013Thomas Johansson · 2013
A Heritage of Open Air Square Temple Discovered In Russia · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Oblivious data structure In computer science, an oblivious data structure is a data structure that gives no information about the sequence or pattern of the operations that have…
- External memory algorithm In computing, external memory algorithms or out-of-core algorithms are algorithms that are designed to process data that are too large to fit into a computer's…
- Parallel RAM In computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended…
- Disjoint-set data structure In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection…
- Cell-probe model In computer science, the cell-probe model is a model of computation similar to the random-access machine, except that all operations are free except memory…
- List-labeling problem In computer science, the list-labeling problem involves maintaining a totally ordered set S supporting the following operations: insert(X), which inserts…
- Pointer machine In theoretical computer science, a pointer machine is an atomistic abstract computational machine whose storage structure is a graph. A pointer algorithm…
- Cache-oblivious algorithm In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having…