Pages that link to "Item:Q1784105"

The following pages link to Yes, there is an oblivious RAM lower bound! (Q1784105):

Displaying 22 items.

• A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← 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)
• Is there an oblivious RAM lower bound? (Q2800584) (← links)
• (Q5875525) (← 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)
• M-ORAM Revisited: Security and Construction Updates (Q6108627) (← links)
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) (← links)
• 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
• Random-index oblivious RAM (Q6169549) (← links)
• OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
• Hermes: I/O-efficient forward-secure searchable symmetric encryption (Q6605326) (← links)