Towards doubly efficient private information retrieval

DOI10.1007/978-3-319-70503-3_23zbMath1416.68063OpenAlexW2728826504MaRDI QIDQ1690292

Ran Canetti, Silas Richelson, Justin Holmgren

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_23

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)

Related Items (14)

Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Permuted puzzles and cryptographic hardness ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ End-to-end secure messaging with traceability only for illegal content ⋮ Collusion-resistant functional encryption for RAMs ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ 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 ⋮ Two-server distributed ORAM with sublinear computation and constant rounds

This page was built for publication: Towards doubly efficient private information retrieval