On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point

被引：6
|
作者：
Ye, Fangwei [1 ,2 ]
Liu, Shiqiu [3 ,4 ]
Shum, Kenneth W. [3 ,5 ]
Yeung, Raymond W. [1 ,3 ]
机构：
[1] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Peoples R China
[2] Rutgers Univ State Univ New Jersey, Dept Elect & Comp Engn, New Brunswick, NJ 08901 USA
[3] Chinese Univ Hong Kong, Inst Network Coding, Hong Kong, Peoples R China
[4] Sun Yat Sen Univ, Sch Elect & Commun Engn, Guangzhou 510006, Guangdong, Peoples R China
[5] Chinese Univ Hong Kong Shenzhen, Sch Sci & Engn, Shenzhen 518172, Guangdong, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2020年 / 66卷 / 01期
关键词：
Secure exact-repair regenerating codes; distributed storage systems; information-theoretic security; DISTRIBUTED STORAGE-SYSTEMS; NETWORK;
D O I：
10.1109/TIT.2019.2942315
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of exact-repair regenerating codes against eavesdropping attack is studied. The eavesdropping model we consider is that the eavesdropper has the capability to observe the data involved in the repair of a subset of l nodes. An (n, k, d, l) secure exact-repair regenerating code is an (n, k, d) exact-repair regenerating code that is secure under this eavesdropping model. It has been shown that for some parameters (n, k, d, l), the associated optimal storage-bandwidth tradeoff curve, which has one corner point, can be determined. The focus of this paper is on characterizing such parameters. We establish a lower bound l on the number of wiretap nodes, and show that this bound is tight for the case k = d = n - 1.
引用
收藏
页码：176 / 201
页数：26
相关论文
共 47 条
12345