More is less: perfectly secure oblivious algorithms in the multi-server setting
From MaRDI portal
Publication:1710668
DOI10.1007/978-3-030-03332-3_7zbMath1447.94025arXiv1809.00825OpenAlexW2890213207MaRDI QIDQ1710668
Elaine Shi, Kartik Nayak, T.-H. Hubert Chan, Antigoni Polychroniadou, Jonathan N. Katz
Publication date: 23 January 2019
Full work available at URL: https://arxiv.org/abs/1809.00825
Related Items (5)
Parameter-hiding order revealing encryption ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Two-server distributed ORAM with sublinear computation and constant rounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfectly secure oblivious parallel RAM
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- Simple and efficient two-server ORAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Perfectly secure oblivious RAM with sublinear bandwidth overhead
- Sub-logarithmic distributed oblivious RAM with small block size
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious RAMs without cryptogrpahic assumptions
- Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
- Perfectly Secure Oblivious RAM without Random Oracles
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Software protection and simulation on oblivious RAMs
- Path ORAM
- Distributed Oblivious RAM for Secure Two-Party Computation
- Asymptotically Tight Bounds for Composing ORAM with PIR
This page was built for publication: More is less: perfectly secure oblivious algorithms in the multi-server setting
