CSpace  > 系统科学研究所
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
Source PublicationSCIENCE CHINA-INFORMATION SCIENCES
ISSN1674-733X
Volume61Issue:10Pages:16
AbstractConsider 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.
Keywordprivate information retrieval sub-packetization access number distributed storage MDS code
DOI10.1007/s11432-018-9538-4
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000444841200001
PublisherSCIENCE PRESS
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/31258
Collection系统科学研究所
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xu, Jingke]'s Articles
[Zhang, Zhifang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xu, Jingke]'s Articles
[Zhang, Zhifang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xu, Jingke]'s Articles
[Zhang, Zhifang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.