Multi-client Oblivious RAM Secure Against Malicious Servers
From MaRDI portal
Recommendations
- Maliciously secure multi-client ORAM
- Multi-client oblivious RAM with poly-logarithmic communication
- Efficient maliciously secure multiparty computation for RAM
- Distributed Oblivious RAM for Secure Two-Party Computation
- Lower bounds for multi-server oblivious RAMs
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- Secure multiparty RAM computation in constant rounds
Cites work
- Dynamic proofs of retrievability via oblivious RAM
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Oblivious parallel RAM and applications
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Path ORAM
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Software protection and simulation on oblivious RAMs
- Zig-zag sort
Cited in
(6)- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Multi-client oblivious RAM with poly-logarithmic communication
- Multi-user binary tree based ORAM scheme
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Maliciously secure multi-client ORAM
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
This page was built for publication: Multi-client Oblivious RAM Secure Against Malicious Servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487224)
