The Capacity of Private Information Retrieval with Disjoint Colluding Sets

被引：0

作者：

Jia, Zhuqing ^{[1
]}

Sun, Hua ^{[1
]}

Jafar, Syed A. ^{[1
]}

机构：

[1] Univ Calif Irvine, CPCC, Irvine, CA 92717 USA

来源：

GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE | 2017年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

An extension of private information retrieval (PIR) with colluding servers is considered. The N servers are partitioned into M disjoint sets, such that collusion can only occur between servers that belong to the same set. Specifically, the m-th set is comprised of N-m servers, of which any T-m can collude. The capacity of this PIR problem is shown to be C = (1 + (Sigma(M)(m-1) N-m/T-m)(-1) +...+(Sigma(M)(m-1) N-m/T-m)(-(K-1)))(-1).

引用

页数：6

共 8 条

[1]

[Anonymous], 2016, ARXIV160209134

[2]

Barkol O, 2007, LECT NOTES COMPUT SC, V4627, P311

[3] General constructions for information-theoretic private information retrieval [J].

Beimel, A ;

Ishai, Y ;

Kushievitz, E .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 71 (02) :213-247

[4]

Chor B, 1995, AN S FDN CO, P41, DOI 10.1109/SFCS.1995.492461

[5]

Chor B., J ACM JACM, V45, P965

[6]

Cover T. M., 2012, ELEMENTS INFORM THEO

[7]

Sun H., 2016, ARXIV160500635

[8]

Tajeddine R., ARXIV170107636

← 1 →