Asymptotically tight bounds for composing ORAM with PIR
From MaRDI portal
Recommendations
Cites work
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Automata, Languages and Programming
- Data-oblivious data structures
- Distributed Oblivious RAM for Secure Two-Party Computation
- Efficient, oblivious data structures for MPC
- How to garble RAM programs?
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Is there an oblivious RAM lower bound?
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Oblivious RAM Revisited
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAMs without cryptogarphic assumptions
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Perfectly secure oblivious RAM without random oracles
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Private database access with HE-over-ORAM architecture
- Private information retrieval
- Software protection and simulation on oblivious RAMs
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Verifiable oblivious storage
Cited in
(16)- SQL on structurally-encrypted databases
- Parameter-hiding order revealing encryption
- Simple and efficient two-server ORAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Two-server distributed ORAM with sublinear computation and constant rounds
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Lower bounds for differentially private RAMs
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Privacy-preserving Dijkstra
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
- MetaDORAM: info-theoretic distributed ORAM with less communication
This page was built for publication: Asymptotically tight bounds for composing ORAM with PIR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738784)
