Simple and efficient two-server ORAM
From MaRDI portal
Recommendations
- Two-server distributed ORAM with sublinear computation and constant rounds
- Efficient 3-party distributed ORAM
- Path ORAM
- Efficient implementation of the Orlandi protocol
- On fast algorithms for two servers
- scientific article; zbMATH DE number 4215366
- Multi-user binary tree based ORAM scheme
- OptORAMa: optimal oblivious RAM
- scientific article; zbMATH DE number 7724191
Cites work
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Asymptotically tight bounds for composing ORAM with PIR
- Automata, Languages and Programming
- Distributed Oblivious RAM for Secure Two-Party Computation
- Function secret sharing
- Oblivious RAM Revisited
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Software protection and simulation on oblivious RAMs
- Three-party ORAM for secure computation
- Verifiable oblivious storage
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
Cited in
(20)- Two-server distributed ORAM with sublinear computation and constant rounds
- Succinct oblivious RAM
- Efficient 3-party distributed ORAM
- 3-party distributed ORAM from oblivious set membership
- Lower bound framework for differentially private and oblivious data structures
- Is there an oblivious RAM lower bound for online reads?
- Private database access with HE-over-ORAM architecture
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- PrORAM
- Random-index oblivious RAM
- Parameter-hiding order revealing encryption
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Three-party ORAM for secure computation
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Is there an oblivious RAM lower bound for online reads?
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- Sub-logarithmic distributed oblivious RAM with small block size
- CNF-FSS and its applications
- Maliciously secure multi-client ORAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
This page was built for publication: Simple and efficient two-server ORAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710667)
