Secure Shortened MSR Codes

被引:0
|
作者
Paunkoska, Natasa [1 ]
Marina, Ninoslav [2 ]
Finamore, Weiler [3 ]
Karamachoski, Jovan [1 ]
机构
[1] UIST, Ohrid, Macedonia
[2] Princeton Univ, Princeton, NJ 08544 USA
[3] Univ Fed Juiz de Fora, Juiz De Fora, Brazil
关键词
distributed storage system (DSS); shortened product-matrix minimum storage regenerating code (PM-ssMSR); perfect security; weak security; DISTRIBUTED STORAGE-SYSTEMS;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes code for secure distributed storage systems (sDSS), called secure shortened product-matrix minimum storage regenerating code (PM-ssMSR). The code uses shortening technique applied on the mother code, product-matrix minimum storage regenerating (PM-MSR), for maintenance of the DSS efficiency and two different methods for achieving the system security. The first method enables by performing random keys technique on the PM-ssMSR code to guarantee perfectly secure system. Hence, the second technique using an outer code achieves weakly secure system. For both cases, their information-theoretic secrecy is proven and is shown that the weakly secure code achieve higher secrecy bandwidth than the perfectly secure code.
引用
收藏
页码:1986 / 1991
页数:6
相关论文
共 50 条