Private anonymous data access
From MaRDI portal
Publication:2292872
DOI10.1007/978-3-030-17656-3_9zbMath1428.94076OpenAlexW2807569012MaRDI QIDQ2292872
Daniel Wichs, Mor Weiss, Rafail Ostrovsky, Ariel Hamlin
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_9
Related Items (11)
Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Collusion-resistant functional encryption for RAMs ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Succinct arguments for RAM programs via projection codes ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Private information retrieval with sublinear online time
This page was built for publication: Private anonymous data access
