Abstract
We show that the single-server computational PIR protocol proposed by Holzbaur, Hollanti and Wachter-Zeh in [6] is not private, in the sense that the server can recover in polynomial time the index of the desired file with very high probability. The attack relies on the following observation. Removing rows of the query matrix corresponding to the desired file yields a large decrease of the dimension over \(\mathbb {F}_q\) of the vector space spanned by the rows of this punctured matrix. Such a dimension loss only shows up with negligible probability when rows unrelated to the requested file are deleted.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Melchor, C.A., Barrier, J., Fousse, L., Killijian, M.-C.: XPIR : Private information retrieval for everyone. PoPETs 2016(2), 155–174 (2016)
Chor, B., Gilboa, N.: Computationally private information retrieval. In: Leighton, F.T., Shor, P.W. (eds.) Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp 304–313. ACM (1997)
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, 23-25 October 1995, pp 41–50. IEEE Computer Society (1995)
Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) Advances in Cryptology - EUROCRYPT ’99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding, volume 1592 of Lecture Notes in Computer Science, pp 402–414. Springer (1999)
Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp 803–815 (2005)
Holzbaur, L., Hollanti, C., Wachter-Zeh, A.: Computational code-based single-server private information retrieval coRR, abs/2001.07049, 2020 Accepted to ISIT (2020)
Kiayias, A., Leonardos, N., Lipmaa, H., Pavlyk, K., Tang, Q.: Optimal rate private information retrieval from homomorphic encryption. PoPETs 2015(2), 222–243 (2015)
Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th Annual Symposium on Foundations of Computer Science, FOCS ’97, Miami Beach, Florida, USA, October 19-22, 1997, pp 364–373. IEEE Computer Society (1997)
Lipmaa, H., Pavlyk, K.: A simpler rate-optimal CPIR protocol. In: Kiayias, A (ed.) Financial Cryptography and Data Security - 21st International Conference, FC 2017, Sliema, Malta, April 3-7, 2017, Revised Selected papers, volume 10322 of Lecture Notes in Computer Science, pp 621–638. Springer (2017)
Yi, X., Kaosar, G, Paulet, R., Bertino, E.: Single-database private information retrieval from fully homomorphic encryption. IEEE Trans. Knowl. Data Eng. 25(5), 1125–1134 (2013)
Acknowledgments
The first author benefits from the support of the Chair “Blockchain & B2B Platforms”, led by l’X – École Polytechnique and the Fondation de l’École Polytechnique, sponsored by Capgemini. The second author is funded by French Direction Générale l’Armement, through the Pôle d’excellence cyber.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bordage, S., Lavauzelle, J. On the privacy of a code-based single-server computational PIR scheme. Cryptogr. Commun. 13, 519–526 (2021). https://doi.org/10.1007/s12095-021-00477-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-021-00477-z