MetaDORAM: info-theoretic distributed ORAM with less communication
From MaRDI portal
Cites work
- 3-party distributed ORAM from oblivious set membership
- 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Advances in Cryptology - CRYPTO 2003
- Asymptotically tight bounds for composing ORAM with PIR
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Distributed Oblivious RAM for Secure Two-Party Computation
- Efficient 3-party distributed ORAM
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- How to simulate it -- a tutorial on the simulation proof technique
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Limits of breach-resistant and snapshot-oblivious RAMs
- Lower bounds for multi-server oblivious RAMs
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious RAM Revisited
- Oblivious RAM with worst-case logarithmic overhead
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- OptORAMa: optimal oblivious RAM
- PanORAMa: oblivious RAM with logarithmic overhead
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Private large-scale databases with distributed searchable symmetric encryption
- Software protection and simulation on oblivious RAMs
- Theory of Cryptography
- Three-party ORAM for secure computation
- Yes, there is an oblivious RAM lower bound!
This page was built for publication: MetaDORAM: info-theoretic distributed ORAM with less communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299424)
