Perfectly secure oblivious RAM without random oracles
From MaRDI portal
Publication:3000537
Recommendations
Cited in
(28)- Stronger lower bounds for online ORAM
- OptORAMa: optimal oblivious RAM
- Oblivious tight compaction in \(O(n)\) time with smaller constant
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- OptORAMa: Optimal oblivious RAM
- Data-oblivious graph algorithms in outsourced external memory
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Constant-round maliciously secure two-party computation in the RAM model
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Perfectly secure oblivious parallel RAM
- Random-index oblivious RAM
- Parameter-hiding order revealing encryption
- Oblivious parallel RAM and applications
- Better two-round adaptive multi-party computation
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Asymptotically tight bounds for composing ORAM with PIR
- Constant-round maliciously secure two-party computation in the RAM model
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Oblivious RAMs without cryptogarphic assumptions
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Maliciously secure multi-client ORAM
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Path ORAM
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Privacy-preserving access of outsourced data via oblivious RAM simulation
This page was built for publication: Perfectly secure oblivious RAM without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000537)
