Near-optimal private information retrieval with preprocessing

DOI10.1007/978-3-031-48618-0_14MaRDI QIDQ6582182zbMATH OpenFDO

Authors Arthur Lazzaretti, Charalampos Papamanthou

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48618-0_14

Mathematics Subject Classification ID

Theory of data (68Pxx) Cryptography (94A60)

Cites work

• 3-query locally decodable codes of subexponential length
• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• A simpler rate-optimal CPIR protocol
• Automata, Languages and Programming
• Communication optimal Tardos-based asymmetric fingerprinting
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 5009196 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 1559546 (Why is no real title available?)
• scientific article; zbMATH DE number 1754644 (Why is no real title available?)
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• Information Security
• Locally decodable codes and private information retrieval schemes.
• Onion ORAM: a constant bandwidth blowup oblivious RAM
• Private constrained PRFs (and more) from LWE
• Private information retrieval
• Private information retrieval with sublinear online time
• Private puncturable PRFs from standard lattice assumptions
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Single-server private information retrieval with sublinear amortized time
• Towards 3-query locally decodable codes of subexponential length
• Universal service-providers for private information retrieval

Cited in

(4)

• Single-server client preprocessing PIR with tight space-time trade-off
• Plinko: single-server PIR with efficient updates via invertible PRFs
• Multi-server doubly efficient PIR in the classical model and beyond
• Two-server private information retrieval in sublinear time and quasilinear space

This page was built for publication: Near-optimal private information retrieval with preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582182)