Information-theoretic multi-server private information retrieval with client preprocessing

DOI10.1007/978-3-031-78023-3_14MaRDI QIDQ6955259zbMATH OpenFDO

Authors Jaspal Singh, Yu Wei, Vassilis Zikas

Publication date 23 July 2025

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

zbMATH Keywords

client preprocessing protocolonline communication complexity

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Information theory (general) (94A15)

Cites work

• 2-server PIR with subpolynomial communication
• 3-query locally decodable codes of subexponential length
• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
• Batch codes and their applications
• Combinatorial batch codes
• Distributed Point Functions and Their Applications
• Efficient pre-processing PIR without public-key cryptography
• Function secret sharing
• scientific article; zbMATH DE number 1304086 (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?)
• One-way functions are essential for 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
• Towards 3-query locally decodable codes of subexponential length
• Trapdoor hash functions and their applications

Cited in

(1)

• Scalable multi-server private information retrieval

This page was built for publication: Information-theoretic multi-server private information retrieval with client preprocessing

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