Anonymous Information Delivery
share
We introduce the problem of anonymous information delivery (AID), comprised of K messages, a user, and N servers (each holds M messages) that wish to deliver one out of K messages to the user anonymously, i.e., without revealing the delivered message index to the user. This AID problem may be viewed as the dual of the private information retrieval problem. The information theoretic capacity of AID, C, is defined as the maximum number of bits of the desired message that can be anonymously delivered per bit of total communication to the user. For the AID problem with K messages, N servers, M messages stored per server, and N ≥K/M, we provide an achievable scheme of rate 1/K/M and an information theoretic converse of rate M/K, i.e., the AID capacity satisfies 1/K/M≤ C ≤ M/K. This settles the capacity of AID when K/M is an integer. When K/M is not an integer, we show that the converse rate of M/K is achievable if N ≥K/(K,M) - (M/(K,M)-1)(K/M -1), and the achievable rate of 1/K/M is optimal if N = K/M. Otherwise if K/M < N < K/(K,M) - (M/(K,M)-1)(K/M -1), we give an improved achievable scheme and prove its optimality for several small settings.
READ FULL TEXT