Pages that link to "Item:Q2139649"

The following pages link to A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649):

Displayed 8 items.

• Single-server private information retrieval with sublinear amortized time (Q2170035) ‎ (← links)
• Oblivious RAM with worst-case logarithmic overhead (Q2697677) ‎ (← links)
• The complexity of secure RAMs (Q6057308) ‎ (← links)
• Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts (Q6111544) ‎ (← links)
• Lower bound framework for differentially private and oblivious data structures (Q6138099) ‎ (← links)
• Lower bounds for (batch) PIR with private preprocessing (Q6138100) ‎ (← links)
• \textsf{MacORAMa}: optimal oblivious RAM with integrity (Q6190099) ‎ (← links)
• Limits of breach-resistant and snapshot-oblivious RAMs (Q6190101) ‎ (← links)