KMS Of Academy of mathematics and systems sciences, CAS
On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers | |
Xu, Jingke1,2; Zhang, Zhifang1,2 | |
2018-10-01 | |
发表期刊 | SCIENCE CHINA-INFORMATION SCIENCES |
ISSN | 1674-733X |
卷号 | 61期号:10页码:16 |
摘要 | Consider the problem of private information retrieval (PIR) over a distributed storage system where M records are stored across N servers by using an [N, K] MDS code. For simplicity, this problem is usually referred as the coded PIR problem. In 2016, Banawan and Ulukus designed the first capacity-achieving coded PIR scheme with sub-packetization KNM and access number MKNM, where capacity characterizes the minimal download size for retrieving per unit of data, and sub-packetization and access number are two metrics closely related to implementation complexity. In this paper, we focus on minimizing the sub-packetization and the access number for linear capacity-achieving coded PIR schemes. We first determine the lower bounds on sub-packetization and access number, which are Kn(M-1) and MKn(M-1), respectively, in the nontrivial cases (i.e., N > K >= 1 and M >1), where n = N/gcd (N,K). We then design a general linear capacity-achieving coded PIR scheme to simultaneously attain these two bounds, implying tightness of both bounds. |
关键词 | private information retrieval sub-packetization access number distributed storage MDS code |
DOI | 10.1007/s11432-018-9538-4 |
语种 | 英语 |
WOS研究方向 | Computer Science ; Engineering |
WOS类目 | Computer Science, Information Systems ; Engineering, Electrical & Electronic |
WOS记录号 | WOS:000444841200001 |
出版者 | SCIENCE PRESS |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/31258 |
专题 | 系统科学研究所 |
通讯作者 | Zhang, Zhifang |
作者单位 | 1.Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Math Mechanizat, Beijing 100190, Peoples R China 2.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China |
推荐引用方式 GB/T 7714 | Xu, Jingke,Zhang, Zhifang. On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers[J]. SCIENCE CHINA-INFORMATION SCIENCES,2018,61(10):16. |
APA | Xu, Jingke,&Zhang, Zhifang.(2018).On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers.SCIENCE CHINA-INFORMATION SCIENCES,61(10),16. |
MLA | Xu, Jingke,et al."On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers".SCIENCE CHINA-INFORMATION SCIENCES 61.10(2018):16. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Xu, Jingke]的文章 |
[Zhang, Zhifang]的文章 |
百度学术 |
百度学术中相似的文章 |
[Xu, Jingke]的文章 |
[Zhang, Zhifang]的文章 |
必应学术 |
必应学术中相似的文章 |
[Xu, Jingke]的文章 |
[Zhang, Zhifang]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论