The following pages link to Verifiable Oblivious Storage (Q5402968):
Displaying 12 items.
- SQL on structurally-encrypted databases (Q1633448) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Disappearing cryptography in the bounded storage model (Q2697865) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement (Q5375573) (← 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)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Maliciously Secure Multi-Client ORAM (Q6487223) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)