PIR with client-side preprocessing: information-theoretic constructions and lower bounds

DOI10.1007/978-3-031-68400-5_5MaRDI QIDQ6653044FDOQ6653044

Authors: Yuval Ishai, Elaine Shi, Daniel Wichs

Publication date: 13 December 2024

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

Cites Work

An Unconditional Study of Computational Zero Knowledge
Secret key agreement by public discussion from common information
An Equivalence Between Zero Knowledge and Commitments
Software protection and simulation on oblivious RAMs
Theory of Cryptography
Title not available (Why is that?)
Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
Title not available (Why is that?)
Information Security
A Survey of Single-Database Private Information Retrieval: Techniques and Applications
From laconic zero-knowledge to public-key cryptography. Extended abstract
Title not available (Why is that?)
Automata, Languages and Programming
On basing private information retrieval on NP-hardness
New realizations of somewhere statistically binding hashing and positional accumulators
Oblivious RAMs without cryptogarphic assumptions
On the communication complexity of secure function evaluation with long output
Perfectly secure oblivious RAM without random oracles
Structure versus hardness through the obfuscation lens
Towards doubly efficient private information retrieval
On distributional collision resistant hashing
Title not available (Why is that?)
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
On the complexity of collision resistant hash functions: new and old black-box separations
Lower bounds for (batch) PIR with private preprocessing
Information-theoretic distributed point functions
Efficient pre-processing PIR without public-key cryptography

This page was built for publication: PIR with client-side preprocessing: information-theoretic constructions and lower bounds

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