2000 character limit reached
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
Published 28 May 2024 in cs.IT and math.IT | (2405.18052v1)
Abstract: A new framework for interference alignment in secure and private information retrieval (PIR) from colluding servers is proposed, generalizing the original cross-subspace alignment (CSA) codes proposed by Jia, Sun, and Jafar. The general scheme is built on algebraic geometry codes and explicit constructions with replicated storage are given over curves of genus zero and one. It is shown that the proposed scheme offers interesting tradeoffs between the field size, file size, number of colluding servers, and the total number of servers. When the field size is fixed, this translates in some cases to higher retrieval rates than those of the original scheme. In addition, the new schemes exist also in cases where the original ones do not.
- B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in Proceedings of IEEE 36th Annual Foundations of Computer Science. IEEE, 1995, pp. 41–50.
- H. Sun and S. A. Jafar, “The capacity of private information retrieval,” IEEE Transactions on Information Theory, vol. 63, no. 7, pp. 4075–4088, 2017.
- 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, April 2018.
- 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, mar 2018.
- R. Tajeddine, O. W. Gnilke, and S. El Rouayheb, “Private information retrieval from MDS coded data in distributed storage systems,” IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7081–7093, 2018.
- R. Freij-Hollanti, O. W. Gnilke, C. Hollanti, and D. A. Karpuk, “Private information retrieval from coded databases with colluding servers,” SIAM Journal on Applied Algebra and Geometry, vol. 1, no. 1, pp. 647–664, 2017.
- R. Tajeddine, O. W. Gnilke, D. Karpuk, R. Freij-Hollanti, and C. Hollanti, “Private information retrieval from coded storage systems with colluding, Byzantine, and unresponsive servers,” IEEE Transactions on Information Theory, vol. 65, no. 6, pp. 3898–3906, 2019.
- R. Freij-Hollanti, O. W. Gnilke, C. Hollanti, A.-L. Horlemann-Trautmann, D. Karpuk, and I. Kubjas, “t-private information retrieval schemes using transitive codes,” IEEE Transactions on Information Theory, vol. 65, no. 4, pp. 2107–2118, 2018.
- R. G. L. D’Oliveira and S. E. Rouayheb, “Lifting private information retrieval from two to any number of messages,” in 2018 IEEE International Symposium on Information Theory (ISIT), June 2018, pp. 1744–1748.
- Z. Jia, H. Sun, and S. A. Jafar, “Cross subspace alignment and the asymptotic capacity of X𝑋Xitalic_X-secure T𝑇Titalic_T-private information retrieval,” IEEE Transactions on Information Theory, vol. 65, no. 9, pp. 5783–5798, Sep. 2019.
- 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.
- Z. Jia and S. A. Jafar, “X𝑋Xitalic_X-secure T𝑇Titalic_T-private information retrieval from MDS coded storage with Byzantine and unresponsive servers,” IEEE Transactions on Information Theory, vol. 66, no. 12, pp. 7427–7438, 2020.
- Z. Chen, Z. Jia, Z. Wang, and S. A. Jafar, “GCSA codes with noise alignment for secure coded multi-party batch matrix multiplication,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 1, pp. 306–316, 2021.
- Z. Jia and S. A. Jafar, “On the capacity of secure distributed batch matrix multiplication,” IEEE Transactions on Information Theory, vol. 67, no. 11, pp. 7420–7437, 2021.
- M. Allaix, Y. Lu, Y. Yao, T. Pllaha, C. Hollanti, and S. Jafar, “N𝑁Nitalic_N-sum box: An abstraction for linear computation over many-to-one quantum networks,” arXiv preprint arXiv:2304.07561, 2023.
- Y. Lu and S. A. Jafar, “Quantum cross subspace alignment codes via the N𝑁Nitalic_N-sum box abstraction,” arXiv preprint arXiv:2304.14676, 2023.
- A. Couvreur, I. Márquez-Corbella, and R. Pellikaan, “Cryptanalysis of McEliece cryptosystem based on algebraic geometry codes and their subcodes,” IEEE Transactions on Information Theory, vol. 63, no. 8, pp. 5404–5418, 2017.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
