Pages that link to "Item:Q5738784"
From MaRDI portal
The following pages link to Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784):
Displaying 8 items.
- SQL on structurally-encrypted databases (Q1633448) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← 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)
