arXiv · 2603.26409
Cryptanalysis of a PIR Scheme based on Linear Codes over Rings
Abstract
In this paper we present an attack on a recently proposed code-based Private Information Retrieval (PIR) scheme. Indeed, the server can retrieve the index of the desired file with high probability in polynomial time. The attack relies on the fact that random codes over finite rings are free with high probability and that the dimension of the rowspan of the query matrix decreases when the rows corresponding to the desired index are removed.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Luana Kurmann, Svenja Lage, Violetta Weger. 2026-03-27. Cryptanalysis of a PIR Scheme based on Linear Codes over Rings. https://arxiv.org/abs/2603.26409
Cite the original work for its findings. Save a collection to share your selection of sources.