Cryptanalysis of a PIR Scheme based on Linear Codes over Rings
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917364495286272 |
|---|---|
| author | Kurmann, Luana Lage, Svenja Weger, Violetta |
| author_facet | Kurmann, Luana Lage, Svenja Weger, Violetta |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_26409 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Cryptanalysis of a PIR Scheme based on Linear Codes over Rings Kurmann, Luana Lage, Svenja Weger, Violetta Cryptography and Security Information Theory 11T71, 94A60, 15B33 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. |
| title | Cryptanalysis of a PIR Scheme based on Linear Codes over Rings |
| topic | Cryptography and Security Information Theory 11T71, 94A60, 15B33 |
| url | https://arxiv.org/abs/2603.26409 |