The Capacity of $T$-Private Information Retrieval with Private Side Information

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, “Private Information Retrieval,” Journal of the ACM (JACM) , vol. 45, no. 6, pp. 965–981, 1998

1998

Earlier work this paper cites.

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, “Protecting data privacy in private information retrieval schemes,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing . ACM, 1998, pp. 151–160

1998

Earlier work this paper cites.

W. Gasarch, “A Survey on Private Information Retrieval,” in Bulletin of the EATCS , 2004

2004

Earlier work this paper cites.

A. Beimel, Y. Ishai, and E. Kushilevitz, “General constructions for information-theoretic private information retrieval,” Journal of Computer and System Sciences , vol. 71, no. 2, pp. 213–247, 2005

2005

Earlier work this paper cites.

R. Ostrovsky and W. E. Skeith III, “A Survey of Single-database Private Information Retrieval: Techniques and Applications,” in Public Key Cryptography–PKC 2007 . Springer, 2007, pp. 393–411

2007

Earlier work this paper cites.

S. Yekhanin, “Private Information Retrieval,” Communications of the ACM , vol. 53, no. 4, pp. 68–73, 2010

2010

Earlier work this paper cites.

N. Shah, K. Rashmi, and K. Ramchandran, “One Extra Bit of Download Ensures Perfectly Private Information Retrieval,” in Proceedings of IEEE International Symposium on Information Theory (ISIT) , 2014, pp. 856–860

2014

Earlier work this paper cites.

T. H. Chan, S.-W. Ho, and H. Yamamoto, “Private Information Retrieval for Coded Storage,” Proceedings of IEEE International Symposium on Information Theory (ISIT) , pp. 2842–2846, 2015

2015

Earlier work this paper cites.

H. Sun and S. A. Jafar, “Blind interference alignment for private information retrieval,” IEEE International Symposium on Information Theory (ISIT) , pp. 560–564, 2016

2016

Earlier work this paper cites.

——, “The Capacity of Private Information Retrieval,” IEEE Transactions on Information Theory , vol. 63, no. 7, pp. 4075–4088, July 2017

2017

Earlier work this paper cites.

Q. Wang and M. Skoglund, “Symmetric Private Information Retrieval For MDS Coded Distributed Storage,” 2017 IEEE International Conference on Communications (ICC) , pp. 1–6, 2017

2017

Cited alongside, same era.

K. Banawan and S. Ulukus, “Multi-message private information retrieval: Capacity results and near-optimal schemes,” arXiv preprint arXiv:1702.01739 , 2017

Original

2017

Cited alongside, same era.

R. Tandon, “The capacity of cache aided private information retrieval,” 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , 2017

2017

Cited alongside, same era.

S. Kadhe, B. Garcia, A. Heidarzadeh, S. E. Rouayheb, and A. Sprintson, “Private information retrieval with side information: The single server case,” 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , 2017

2017

Cited alongside, same era.

——, “Cache-aided private information retrieval with partially known uncoded prefetching: fundamental limits,” IEEE Jour. on Selected Areas in Communications , vol. 36, no. 6, pp. 1126–1139, 2018

2018

Closest in time.

A. Heidarzadeh, F. Kazemi, and A. Sprintson, “Capacity of single-server single-message private information retrieval with coded side information,” arXiv preprint arXiv:1806.00661 , 2018

Original

2018

Closest in time.

A. Heidarzadeh, B. Garcia, S. Kadhe, S. E. Rouayheb, and A. Sprintson, “On the capacity of single-server multi-message private information retrieval with side information,” arXiv preprint arXiv:1807.09908 , 2018

Original

2018

Closest in time.

S. Li and M. Gastpar, “Converse for multi-server single-message pir with side information,” arXiv preprint arXiv:1809.09861 , 2018

Original

2018

Closest in time.