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