Oblivious RAM Revisited
From MaRDI portal
Recommendations
- Succinct oblivious RAM
- Oblivious RAM with worst-case logarithmic overhead
- OptORAMa: optimal oblivious RAM
- Oblivious parallel RAM and applications
- Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
- Oblivious parallel RAM: improved efficiency and generic constructions
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- Perfectly secure oblivious parallel RAM
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Random-index oblivious RAM
Cited in
(43)- Succinct oblivious RAM
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- 3-party distributed ORAM from oblivious set membership
- Weighted oblivious RAM, with applications to searchable symmetric encryption
- Locality-preserving oblivious RAM
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Random-index oblivious RAM
- Perfectly secure oblivious RAM without random oracles
- SQL on structurally-encrypted databases
- Oblivious parallel RAM: improved efficiency and generic constructions
- Simple and efficient two-server ORAM
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Verifiable oblivious storage
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Cache-oblivious and data-oblivious sorting and applications
- Asymptotically tight bounds for composing ORAM with PIR
- 3D Visibility Representations of 1-planar Graphs
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Effective error-tolerant keyword search for secure cloud computing
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- On the depth of oblivious parallel RAM
- Oblivious RAMs without cryptogarphic assumptions
- Data-oblivious data structures
- Multi-user image retrieval with suppression of search pattern leakage
- Anonymous RAM
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Locality-preserving oblivious RAM
- Forward secret encrypted RAM: lower bounds and applications
- Maliciously secure multi-client ORAM
- Adaptive garbled RAM from laconic oblivious transfer
- scientific article; zbMATH DE number 1559561 (Why is no real title available?)
- Path ORAM
- The Melbourne shuffle: improving oblivious storage in the cloud
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- M-ORAM Revisited: Security and Construction Updates
- Dynamic proofs of retrievability via oblivious RAM
- Foundations of differentially oblivious algorithms
- CacheShuffle: a family of oblivious shuffles
- Privacy-preserving access of outsourced data via oblivious RAM simulation
This page was built for publication: Oblivious RAM Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582774)
