Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929362103697408 |
|---|---|
| author | Makkonen, Okko Karpuk, David Hollanti, Camilla |
| author_facet | Makkonen, Okko Karpuk, David Hollanti, Camilla |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_18052 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval Makkonen, Okko Karpuk, David Hollanti, Camilla Information Theory 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. |
| title | Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.18052 |