Mohamed Nomeir

This paper generalizes the definition of privacy in graph-replicated Private Information Retrieval (PIR) by allowing each server to have an arbitrary, specific set of message indices it must keep private, deriving capacity bounds for path and cyclic graphs.

The paper introduces local private information retrieval (local PIR), redefining user privacy in graph-replicated systems to focus on hiding the message index from servers, and demonstrates that local PIR offers significant communication efficiency gains, especially for graphs that are disjoint unions of distinct graphs.