Converse for Multi-Server Single-Message PIR with Side Information
share
Multi-server single-message private information retrieval is studied in the presence of side information. In this problem, K independent messages are replicatively stored at N non-colluding servers. The user wants to privately download one message from the servers without revealing the index of the message to any of the servers, leveraging its M side information messages. It is shown that the capacity for this problem is (1+1/N+1/N^2+...+1/N^K/M+1-1)^-1.
READ FULL TEXT