Papers
Topics
Authors
Recent
Search
2000 character limit reached

A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval

Published 29 Jan 2024 in cs.IT and math.IT | (2401.16628v1)

Abstract: This paper presents new solutions for Private Information Retrieval (PIR) with side information. This problem is motivated by PIR settings in which a client has side information about the data held by the servers and would like to leverage this information in order to improve the download rate. The problem of PIR with side information has been the subject of several recent studies that presented achievability schemes as well as converses for both multi-server and single-server settings. However, the solutions for the multi-server settings adapted from the solutions for the single-server setting in a rather straightforward manner, relying on the concept of super-messages. Such solutions require an exponential degree of sub-packetization (in terms of the number of messages). This paper makes the following contributions. First, we revisit the PIR problem with side information and present a new approach to leverage side information in the context of PIR. The key idea of our approach is a randomized algorithm to determine the linear combinations of the sub-packets that need to be recovered from each server. In addition, our approach takes advantage of the fact that the identity of the side information messages does not need to be kept private, and, as a result, the information retrieval scheme does not need to be symmetric. Second, we present schemes for PIR with side information that achieve a higher rate than previously proposed solutions and require a significantly lower degree of sub-packetization (linear in the number of servers). Our scheme not only achieves the highest known download rate for the problem at hand but also invalidates a previously claimed converse bound on the maximum achievable download rate.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. 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.
  2. H. Sun and S. A. Jafar, “The Capacity of Private Information Retrieval,” IEEE Transactions on Information Theory, vol. 63, no. 7, pp. 4075–4088, July 2017.
  3. ——, “Optimal download cost of private information retrieval for arbitrary message length,” IEEE Transactions on Information Forensics and Security, vol. 12, no. 12, pp. 2920–2932, 2017.
  4. C. Tian, H. Sun, and J. Chen, “Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost,” IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 7613–7627, 2019.
  5. S. Vithana, K. Banawan, and S. Ulukus, “Semantic Private Information Retrieval,” IEEE Transactions on Information Theory, vol. 68, no. 4, pp. 2635–2652, 2022.
  6. H. Sun and S. A. Jafar, “The Capacity of Robust Private Information Retrieval with Colluding Databases,” IEEE Transactions on Information Theory, vol. 64, no. 4, pp. 2361–2370, 2018.
  7. K. Banawan and S. Ulukus, “The Capacity of Private Information Retrieval from Byzantine and Colluding Databases,” IEEE Transactions on Information Theory, vol. 65, no. 2, pp. 1206–1219, 2019.
  8. Z. Zhang and J. Xu, “The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes with Colluding Servers,” IEEE Transactions on Information Theory, vol. 65, no. 5, pp. 2723–2735, 2019.
  9. X. Yao, N. Liu, and W. Kang, “The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns,” in IEEE International Symposium on Information Theory, 2020, pp. 1041–1046.
  10. Y. Lu, Z. Jia, and S. A. Jafar, “Double Blind T-Private Information Retrieval,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 1, pp. 428–440, 2021.
  11. L. Holzbaur, R. Freij-Hollanti, J. Li, and C. Hollanti, “Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers,” IEEE Transactions on Information Theory, vol. 68, no. 1, pp. 517–537, 2022.
  12. R. Zhou, C. Tian, H. Sun, and J. S. Plank, “Two-level private information retrieval,” IEEE Journal on Selected Areas in Information Theory, vol. 3, no. 2, pp. 337–349, 2022.
  13. R. Tajeddine, O. W. Gnilke, D. Karpuk, R. Freij-Hollanti, C. Hollanti, and S. E. Rouayheb, “Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns,” in IEEE International Symposium on Information Theory, June 2017, pp. 1908–1912.
  14. K. Banawan and S. Ulukus, “The Capacity of Private Information Retrieval from Coded Databases,” IEEE Transactions on Information Theory, vol. 64, no. 3, pp. 1945–1956, March 2018.
  15. K. Banawan, B. Arasli, Y.-P. Wei, and S. Ulukus, “The Capacity of Private Information Retrieval From Heterogeneous Uncoded Caching Databases,” IEEE Transactions on Information Theory, vol. 66, no. 6, pp. 3407–3416, 2020.
  16. K. Banawan and S. Ulukus, “Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes,” IEEE Transactions on Information Theory, vol. 64, no. 10, pp. 6842–6862, Oct 2018.
  17. N. Wang, A. Heidarzadeh, and A. Sprintson, “Multi-Message Private Information Retrieval: A Scalar Linear Solution,” in 2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2022, pp. 1–8.
  18. S. Kadhe, B. Garcia, A. Heidarzadeh, S. E. Rouayheb, and A. Sprintson, “Private Information Retrieval with Side Information: The Single Server Case,” in 55th Annual Allerton Conf. on Commun., Control, and Computing, Oct 2017, pp. 1099–1106.
  19. S. Li and M. Gastpar, “Single-Server Multi-Message Private Information Retrieval with Side Information,” in 56th Annual Allerton Conf. on Commun., Control, and Computing, Oct 2018.
  20. A. Gomez-Leos and A. Heidarzadeh, “Single-Server Private Information Retrieval with Side Information Under Arbitrary Popularity Profiles,” in 2022 IEEE Information Theory Workshop (ITW), 2022, pp. 101–106.
  21. A. Heidarzadeh, F. Kazemi, and A. Sprintson, “Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information,” in IEEE Information Theory Workshop, Nov 2018.
  22. ——, “Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information,” in IEEE International Symposium on Information Theory, July 2019, pp. 1662–1666.
  23. A. Heidarzadeh, S. Kadhe, S. E. Rouayheb, and A. Sprintson, “Single-Server Multi-Message Individually-Private Information Retrieval with Side Information,” in IEEE International Symposium on Information Theory, July 2019, pp. 1042–1046.
  24. F. Kazemi, E. Karimi, A. Heidarzadeh, and A. Sprintson, “Single-Server Single-Message Online Private Information Retrieval with Side Information,” in IEEE International Symposium on Information Theory, July 2019, pp. 350–354.
  25. A. Heidarzadeh, F. Kazemi, and A. Sprintson, “The Role of Coded Side Information in Single-Server Private Information Retrieval,” IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 25–44, 2021.
  26. S. Kadhe, A. Heidarzadeh, A. Sprintson, and O. O. Koyluoglu, “Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 1, pp. 391–402, 2021.
  27. A. Heidarzadeh and A. Sprintson, “Single-Server Individually-Private Information Retrieval: A Combinatorial Approach,” in IEEE Information Theory Workshop, 2021.
  28. ——, “The Role of Reusable and Single-Use Side Information in Private Information Retrieval,” in 2022 IEEE International Symposium on Information Theory (ISIT), 2022, pp. 414–419.
  29. Y. Lu and S. A. Jafar, “On single server private information retrieval with private coded side information,” IEEE Transactions on Information Theory, vol. 69, no. 5, pp. 3263–3284, 2023.
  30. A. Heidarzadeh, S. Kadhe, B. Garcia, S. E. Rouayheb, and A. Sprintson, “On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information,” in 56th Annual Allerton Conf. on Commun., Control, and Computing, Oct 2018.
  31. R. Tandon, “The Capacity of Cache Aided Private Information Retrieval,” in 55th Annual Allerton Conf. on Commun., Control, and Computing, Oct 2017, pp. 1078–1082.
  32. Y. Wei, K. Banawan, and S. Ulukus, “Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits,” IEEE Journal on Selected Areas in Communications, vol. 36, no. 6, pp. 1126–1139, June 2018.
  33. Y.-P. Wei, K. Banawan, and S. Ulukus, “Fundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching,” IEEE Transactions on Information Theory, vol. 65, no. 5, pp. 3215–3232, 2019.
  34. F. Kazemi, E. Karimi, A. Heidarzadeh, and A. Sprintson, “Multi-Server Private Information Retrieval with Coded Side Information,” in Canadian Workshop on Information Theory, 2019.
  35. S. Kadhe, B. Garcia, A. Heidarzadeh, S. El Rouayheb, and A. Sprintson, “Private Information Retrieval with Side Information,” IEEE Transactions on Information Theory, vol. 66, no. 4, pp. 2032–2043, 2020.
  36. S. Li and M. Gastpar, “Converse for Multi-Server Single-Message PIR with Side Information,” in 54th Annual Conference on Information Sciences and Systems, 2020, pp. 1–6.
  37. Z. Chen, Z. Wang, and S. A. Jafar, “The Capacity of T-Private Information Retrieval with Private Side Information,” IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 4761–4773, 2020.
  38. M. Krishnan K. H. and J. Harshan, “On the Existence of XOR-Based Codes for Private Information Retrieval with Private Side Information,” Entropy, vol. 23, no. 10, 2021. [Online]. Available: https://www.mdpi.com/1099-4300/23/10/1287
  39. L. Erhili and A. Heidarzadeh, “Achieving Capacity of PIR with Private Side Information with Low Sub-pakcetization and without MDS Codes,” Jan 2024. [Online]. Available: arXiv.
  40. F. Kazemi, E. Karimi, A. Heidarzadeh, and A. Sprintson, “Private Information Retrieval with Private Coded Side Information: The Multi-Server Case,” in 57th Annual Allerton Conference on Communication, Control, and Computing, 2019, pp. 1098–1104.
  41. S. P. Shariatpanahi, M. J. Siavoshani, and M. A. Maddah-Ali, “Multi-Message Private Information Retrieval with Private Side Information,” in IEEE Information Theory Workshop, 2018.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.

Sign Up for Free