Simple and efficient two-server ORAM
From MaRDI portal
Publication:1710667
DOI10.1007/978-3-030-03332-3_6zbMath1447.94040OpenAlexW2794597202MaRDI QIDQ1710667
S. Dov Gordon, Xiao Wang, Jonathan N. Katz
Publication date: 23 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_6
Related Items (9)
Parameter-hiding order revealing encryption ⋮ CNF-FSS and Its Applications ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Random-index oblivious RAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Two-server distributed ORAM with sublinear computation and constant rounds
Cites Work
- Three-Party ORAM for Secure Computation
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Function Secret Sharing
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Oblivious RAM Revisited
- Software protection and simulation on oblivious RAMs
- Distributed Oblivious RAM for Secure Two-Party Computation
- Verifiable Oblivious Storage
- Automata, Languages and Programming
- Asymptotically Tight Bounds for Composing ORAM with PIR
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simple and efficient two-server ORAM