Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers
| Autor: | Ragnar Freij-Hollanti, Camilla Hollanti, Jie Li, Lukas Holzbaur |
|---|---|
| Rok vydání: | 2022 |
| Předmět: |
Theoretical computer science
Computer science 020206 networking & telecommunications 02 engineering and technology Library and Information Sciences Expression (mathematics) Computer Science Applications Finite field Single antenna interference cancellation Server Converse 0202 electrical engineering electronic engineering information engineering Capacity loss Private information retrieval Randomness Information Systems |
| Zdroj: | IEEE Transactions on Information Theory. 68:517-537 |
| ISSN: | 1557-9654 0018-9448 |
| DOI: | 10.1109/tit.2021.3120316 |
| Popis: | In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse result for a capacity expression and satisfied by almost all currently known capacity-achieving schemes, while strong linearity is a practical requirement enabling implementation over small finite fields with low subpacketization degree. Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived, as well as the capacity of symmetric, linear PIR with colluding, adversarial, and nonresponsive servers for the recently introduced concept of matched randomness. This positively settles the capacity conjectures stated by Freij-Hollanti et al. and Tajeddine et al. in the presented cases. It is also shown that, further restricting to strongly-linear PIR schemes with deterministic linear interference cancellation, the so-called star product scheme proposed by Freij-Hollanti et al. is essentially optimal and induces no capacity loss. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|