Oblivious RAM with worst-case logarithmic overhead
From MaRDI portal
Recommendations
Cites work
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Cuckoo hashing
- Distributed Oblivious RAM for Secure Two-Party Computation
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Is there an oblivious RAM lower bound?
- More robust hashing: cuckoo hashing with a stash
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- OptORAMa: optimal oblivious RAM
- Perfectly secure oblivious parallel RAM
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Private database access with HE-over-ORAM architecture
- Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
- Software protection and simulation on oblivious RAMs
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Surpassing the information theoretic bound with fusion trees
- Universally composable security
- Yes, there is an oblivious RAM lower bound!
Cited in
(21)- OptORAMa: optimal oblivious RAM
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- Sub-logarithmic distributed oblivious RAM with small block size
- On the depth of oblivious parallel RAM
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAM Revisited
- Is there an oblivious RAM lower bound for online reads?
- Locality-preserving oblivious RAM
- PrORAM
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- OptORAMa: Optimal oblivious RAM
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Memory checking requires logarithmic overhead
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Optimal offline ORAM with perfect security via simple oblivious priority queues
- MetaDORAM: info-theoretic distributed ORAM with less communication
- Updatable private set intersection from symmetric-key techniques
This page was built for publication: Oblivious RAM with worst-case logarithmic overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697677)
