Scalable multi-server private information retrieval

DOI10.1007/978-3-032-12290-2_19MaRDI QIDQ7233247zbMATH OpenFDO

Authors Ashrujit Ghoshal, Baitian Li, Yaohua Ma, Chenxin Dai, Elaine Shi

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12290-2_19

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60)

Cites work

• 2-server PIR with subpolynomial communication
• \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Automata, Languages and Programming
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• Efficient pre-processing PIR without public-key cryptography
• Fast multivariate multipoint evaluation over all finite fields
• Fast polynomial factorization and modular composition
• Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
• High-rate codes with sublinear-time decoding
• scientific article; zbMATH DE number 5604104 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• Information Security and Privacy
• Information-theoretic multi-server private information retrieval with client preprocessing
• Locally decodable codes
• Private information retrieval with sublinear online time
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
• Reducing the servers' computation in private information retrieval: PIR with preprocessing
• Single-server private information retrieval with sublinear amortized time
• Some remarks on multiplicity codes
• The bottleneck complexity of secure multiparty computation
• Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.

Cited in

(1)

• Two-server private information retrieval in sublinear time and quasilinear space

This page was built for publication: Scalable multi-server private information retrieval

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