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 条
  • [21] Shortened array codes of large girth
    Milenkovic, Olgica
    Kashyap, Navin
    Leyba, David
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (08) : 3707 - 3722
  • [22] Determination of best shortened linear codes
    ABB Network Control, Turgi, Switzerland
    IEEE Trans Commun, 1 (1-6):
  • [23] Error detection capability of shortened hamming codes and their dual codes
    Xia Shutao
    Fu Fangwei
    Acta Mathematicae Applicatae Sinica, 2000, 16 (3) : 292 - 298
  • [24] ERROR DETECTION CAPABILITY OF SHORTENED HAMMING CODES AND THEIR DUAL CODES
    夏树涛
    符方伟
    Acta Mathematicae Applicatae Sinica(English Series), 2000, (03) : 292 - 298
  • [25] Opening the Chrysalis: On the Real Repair Performance of MSR Codes
    Pamies-Juarez, Lluis
    Blagojevic, Filip
    Mateescu, Robert
    Guyot, Cyril
    Gad, Eyal En
    Bandic, Zvonimir
    14TH USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES (FAST '16), 2016, : 81 - 94
  • [26] Rack-aware MSR codes with optimal access
    Chen, Zitan
    2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 19 - 24
  • [27] CLAY AND PRODUCT-MATRIX MSR CODES WITH LOCALITY
    Gao, Minhan
    Holzbaur, Lukas
    Wachter-zeh, Antonia
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2024, 18 (05) : 1480 - 1491
  • [28] SOME SHORTENED CODES FROM LINEAR CODES CONSTRUCTED BY DEFINING SETS
    Xiang, Can
    Tang, Chunming
    Guo, Min
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2022, 16 (04) : 1059 - 1069
  • [29] CLASS OF SHORTENED CYCLIC CODES FOR A COMPOUND CHANNEL
    HSU, HT
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) : 129 - 131
  • [30] Shortened Linear Codes Over Finite Fields
    Liu, Yang
    Ding, Cunsheng
    Tang, Chunming
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (08) : 5119 - 5132