Pages that link to "Item:Q2800584"
From MaRDI portal
The following pages link to Is there an oblivious RAM lower bound? (Q2800584):
Displaying 20 items.
- Yes, there is an oblivious RAM lower bound! (Q1784105) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- Oblivious tight compaction in \(O(n)\) time with smaller constant (Q2106644) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Forward secret encrypted RAM: lower bounds and applications (Q2697886) (← links)
- Oblivious RAMs without cryptogarphic assumptions (Q2875144) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← links)
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
- Random-index oblivious RAM (Q6169549) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
