Private information retrieval (PIR) enables a user to retrieve a specific data item from a
database, replicated among one or more servers, while hiding from each server the identity
of the retrieved item. This problem was suggested by Chor et al.[11], and since then efficient
protocols with sub-linear communication were suggested. However, in all these protocols
the servers' computation for each retrieval is at least linear in the size of entire database,
even if the user requires just one bit. In this paper, we study the computational complexity of …

Private information retrieval (PIR) enables a user to retrieve a speci c data item from a
database, replicated among one or more servers, while hiding from each server the identity
of the retrieved item. This problem was suggested by Chor et al. 11], and since then e cient
protocols with sub-linear communication were suggested. However, in all these protocols
the servers' computation for each retrieval is at least linear in the size of entire database,
even if the user requires just one bit. In this paper, we study the computational complexity of …