Single-server client preprocessing PIR with tight space-time trade-off

DOI10.1007/978-3-031-91095-1_4MaRDI QIDQ6891217zbMATH OpenFDO

Authors Zhikun Wang, Ling Ren

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91095-1_4

zbMATH Keywords

tight trade-off of client storage and server time

Mathematics Subject Classification ID

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

Cites work

• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• An enciphering scheme based on a card shuffle
• Automata, Languages and Programming
• Batch codes and their applications
• Can we access a database both locally and privately?
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• Efficient pre-processing PIR without public-key cryptography
• scientific article; zbMATH DE number 5009195 (Why is no real title available?)
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 1559546 (Why is no real title available?)
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• Information Security and Privacy
• Lower bounds for (batch) PIR with private preprocessing
• Near-optimal private information retrieval with preprocessing
• Optimal single-server private information retrieval
• PIR with client-side preprocessing: information-theoretic constructions and lower bounds
• Private information retrieval
• Private information retrieval with sublinear online time
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Single-server private information retrieval with sublinear amortized time
• Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
• The mix-and-cut shuffle: small-domain encryption secure against N queries
• Towards doubly efficient private information retrieval

Cited in

(2)

• 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: Single-server client preprocessing PIR with tight space-time trade-off

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