Pages that link to "Item:Q2139649"
From MaRDI portal
The following pages link to A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649):
Displaying 4 items.
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)