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 条
  • [21] Exact-Repair Codes With Partial Collaboration in Distributed Storage Systems
    Liu, Shiqiu
    Shum, Kenneth W.
    Li, Congduan
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (07) : 4012 - 4021
  • [22] Optimal regenerating codes for cooperative repair
    Ye, Min
    Barg, Alexander
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1939 - 1943
  • [23] Exact-Repair MDS Codes for Distributed Storage Using Interference Alignment
    Suh, Changho
    Ramchandran, Kannan
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 161 - 165
  • [24] Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems
    Liang, Songtao
    Yuan, Chen
    Kan, Haibin
    IEEE COMMUNICATIONS LETTERS, 2014, 18 (07) : 1095 - 1098
  • [25] A New Construction of Exact-Repair MSR Codes Using Linearly Dependent Vectors
    Guan, Sheng
    Kan, Haibin
    Wen, Jie
    Xia, Shuli
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (08) : 1691 - 1694
  • [26] New Exact-Repair Codes for Distributed Storage Systems Using Matrix Determinant
    Elyasi, Mehran
    Mohajer, Soheil
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1212 - 1216
  • [27] Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage
    Rashmi, K. V.
    Shah, Nihar B.
    Kumar, P. Vijay
    Ramchandran, Kannan
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1938 - 1942
  • [28] Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage
    Rashmi, K. V.
    Shah, Nihar B.
    Kumar, P. Vijay
    Ramchandran, Kannan
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 1243 - +
  • [29] Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme
    Bian, Jianchao
    Luo, Shoushan
    Li, Zhengwen
    Yang, Yixian
    IEEE ACCESS, 2019, 7 : 151120 - 151130
  • [30] Permutation Code: Optimal Exact-Repair of a Single Failed Node in MDS Code Based Distributed Storage Systems
    Cadambe, Viveck R.
    Huang, Cheng
    Li, Jin
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1225 - 1229
12345