On the Subpacketization Level of the Banawan-Ulukus Multi-Message PIR Scheme
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915790161182720 |
|---|---|
| author | Heidarzadeh, Anoosheh |
| author_facet | Heidarzadeh, Anoosheh |
| contents | This note analyzes a linear recursion that arises in the computation of the subpacketization level for the multi-message PIR scheme of Banawan and Ulukus. We derive an explicit representation for the normalized subpacketization level $L$, whose smallest integer multiple yields the subpacketization level of the scheme, in terms of the number of servers $N$, the total number of messages $K$, and the number of demand messages $D$. The resulting formula shows that $L$ is a polynomial in $N$ with nonnegative coefficients, and its leading term is $N^{K-D+1}/D$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_09417 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Subpacketization Level of the Banawan-Ulukus Multi-Message PIR Scheme Heidarzadeh, Anoosheh Information Theory This note analyzes a linear recursion that arises in the computation of the subpacketization level for the multi-message PIR scheme of Banawan and Ulukus. We derive an explicit representation for the normalized subpacketization level $L$, whose smallest integer multiple yields the subpacketization level of the scheme, in terms of the number of servers $N$, the total number of messages $K$, and the number of demand messages $D$. The resulting formula shows that $L$ is a polynomial in $N$ with nonnegative coefficients, and its leading term is $N^{K-D+1}/D$. |
| title | On the Subpacketization Level of the Banawan-Ulukus Multi-Message PIR Scheme |
| topic | Information Theory |
| url | https://arxiv.org/abs/2602.09417 |