Cryptanalysis of a PIR Scheme based on Linear Codes over Rings

Computer Science > Cryptography and Security [Submitted on 27 Mar 2026] Cryptanalysis of a PIR Scheme based on Linear Codes over Rings Luana Kurmann, Svenja Lage, Violetta Weger 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. Subjects: Cryptography and Security (cs.CR); Information Theory (cs.IT) MSC classes: 11T71, 94A60, 15B33 Cite as: arXiv:2603.26409 [cs.CR]   (or arXiv:2603.26409v1 [cs.CR] for this version)   https://doi.org/10.48550/arXiv.2603.26409 Focus to learn more Submission history From: Luana Kurmann [view email] [v1] Fri, 27 Mar 2026 13:37:57 UTC (17 KB) Access Paper: HTML (experimental) view license Current browse context: cs.CR < prev   |   next > new | recent | 2026-03 Change to browse by: cs cs.IT math math.IT References & Citations NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)