arXiv Open Access 2020

The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns

Xinyu Yao Nan Liu Wei Kang

Lihat Sumber

Abstrak

We study the private information retrieval (PIR) problem under arbitrary collusion pattern for replicated databases. We find its capacity, which is the same as the capacity of the original PIR problem with the number of databases $N$ replaced by a number $S^*$. The number $S^*$ is the optimal solution to a linear programming problem that is a function of the collusion pattern. Hence, the collusion pattern affects the capacity of the PIR problem only through the number $S^*$.

Topik & Kata Kunci

cs.IT

Penulis (3)

Xinyu Yao

Nan Liu

Wei Kang

Format Sitasi

APA MLA BibTeX

Yao, X., Liu, N., Kang, W. (2020). The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns. https://arxiv.org/abs/2001.03843

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓