OptORAMa: optimal oblivious RAM
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3757704 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 1263219 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- Cache-oblivious and data-oblivious sorting and applications
- Can we overcome the n n barrier for oblivious sorting?
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Data-oblivious data structures
- Distributed Oblivious RAM for Secure Two-Party Computation
- Graph-theoretic properties in computational complexity
- Improved nonconservative sequential and parallel integer sorting
- Internal DLA: efficient simulation of a physical growth model (extended abstract)
- Introduction to algorithms.
- Is there an oblivious RAM lower bound?
- Lower bounds for external memory integer sorting via network coding
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- On probabilistic networks for selection, merging, and sorting
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Perfectly secure oblivious RAM without random oracles
- Perfectly secure oblivious parallel RAM
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Private database access with HE-over-ORAM architecture
- Self-routing superconcentrators
- Software protection and simulation on oblivious RAMs
- Sorting in \(c \log n\) parallel steps
- Superconcentrators
- Yes, there is an oblivious RAM lower bound!
- Zig-zag sort
Cited in
(35)- Stronger lower bounds for online ORAM
- Two-server distributed ORAM with sublinear computation and constant rounds
- 3-party distributed ORAM from oblivious set membership
- Lower bound framework for differentially private and oblivious data structures
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Weighted oblivious RAM, with applications to searchable symmetric encryption
- Is there an oblivious RAM lower bound for online reads?
- OptORAMa: Optimal oblivious RAM
- Oblivious RAM Revisited
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- 3-party secure computation for RAMs: optimal and concretely efficient
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Memory checking for parallel RAMs
- PrORAM
- Random-index oblivious RAM
- Simple and efficient two-server ORAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Differentially oblivious Turing machines
- On the depth of oblivious parallel RAM
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Limits of breach-resistant and snapshot-oblivious RAMs
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Locality-preserving oblivious RAM
- Forward secret encrypted RAM: lower bounds and applications
- Linear-size Boolean circuits for multiselection
- Path ORAM
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- The complexity of secure RAMs
- Klee's measure problem made oblivious
- Oblivious RAM with worst-case logarithmic overhead
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$
This page was built for publication: OptORAMa: optimal oblivious RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119019)
