onsubpacketizationandaccessnumberofcapacityachievingpirschemesformdscodednoncolludingservers

CSpace > 系统科学研究所

	onsubpacketizationandaccessnumberofcapacityachievingpirschemesformdscodednoncolludingservers
	Xu Jingke; Zhang Zhifang
	2018
发表期刊	sciencechinainformationscience
ISSN	1674-733X
卷号	061 期号:010 页码:100306
摘要	Consider the problem of private information retrieval （PR） over a distributed storage systemwhere M records are stored across N servers by using an N, K MDS code. For simplicity, this problemis 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 capacitycharacterizes the minimal download size for retrieving per unit of data, and sub-packetization and accessnumber are two metrics closely related to implementation complexity. In this paper, we focus on minimizingthe sub-packetization and the access number for linear capacity-achieving coded PIR schemes. We firstdetermine the lower bounds on sub-packetization and access number, which are KnM-1 and MKnM-l,respectively, in the nontrivial cases （i.e., N 〉 K ≥ 1 and M 〉 1）, where n = N/gcd（N, K）. We then designa general linear capacity-achieving coded PIR scheme to simultaneously attain these two bounds, implyingtightness of both bounds.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/47298
专题	系统科学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Xu Jingke,Zhang Zhifang. onsubpacketizationandaccessnumberofcapacityachievingpirschemesformdscodednoncolludingservers[J]. sciencechinainformationscience,2018,061(010):100306.
APA	Xu Jingke,&Zhang Zhifang.(2018).onsubpacketizationandaccessnumberofcapacityachievingpirschemesformdscodednoncolludingservers.sciencechinainformationscience,061(010),100306.
MLA	Xu Jingke,et al."onsubpacketizationandaccessnumberofcapacityachievingpirschemesformdscodednoncolludingservers".sciencechinainformationscience 061.010(2018):100306.