Lower bound framework for differentially private and oblivious data structures

Cites Work

Preserving order in a forest in less than logarithmic time and linear space
Worst-case Analysis of Set Union Algorithms
The cell probe complexity of dynamic range counting
Software protection and simulation on oblivious RAMs
Title not available (Why is that?)
Logarithmic Lower Bounds in the Cell-Probe Model
On dynamic bit-probe complexity
Oblivious Parallel RAM and Applications
Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Title not available (Why is that?)
Simple and efficient two-server ORAM
Distributed Oblivious RAM for Secure Two-Party Computation
OptORAMa: optimal oblivious RAM
Yes, there is an oblivious RAM lower bound!
Reducing the servers' computation in private information retrieval: PIR with preprocessing
Private information retrieval with sublinear online time
A lower bound for one-round oblivious RAM
Lower bounds for multi-server oblivious RAMs
Is there an oblivious RAM lower bound for online reads?
Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
Stronger lower bounds for online ORAM
Lower bounds for differentially private RAMs
Is there an oblivious RAM lower bound?
Foundations of Differentially Oblivious Algorithms
Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
A logarithmic lower bound for oblivious RAM (for all Parameters)
Lower Bounds for Oblivious Near-Neighbor Search
Lower Bounds for Oblivious Data Structures
Single-server private information retrieval with sublinear amortized time

This page was built for publication: Lower bound framework for differentially private and oblivious data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138099)