Improvement of preprocessing complexity in private information retrieval

Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing

Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem

Improved upper bounds on information-theoretic private information retrieval

Upper bound on the communication complexity of private information retrieval

Lower Bounds for Communication Complexity of Private Information Retrieval

On Lower Bounds for the Communication Complexity of Private Information Retrieval