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 条
  • [1] Improving DSS Efficiency with Shortened MSR Codes
    Paunkoska, Natasa
    Finamore, Weiler
    Karamacoski, Jovan
    Punceva, Magdalena
    Marina, Ninoslav
    2016 8TH INTERNATIONAL CONGRESS ON ULTRA MODERN TELECOMMUNICATIONS AND CONTROL SYSTEMS AND WORKSHOPS (ICUMT), 2016, : 257 - 262
  • [2] OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES
    Sasidharan, B.
    Kumar, P. V.
    Shah, N. B.
    Rashmi, K. V.
    Ramachandran, K.
    2014 6TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS, CONTROL AND SIGNAL PROCESSING (ISCCSP), 2014, : 10 - 14
  • [3] Secure Regenerating Codes Using Linear MBR/MSR Codes and the All-or-Nothing Transform
    Kuwakado, Hidenori
    Kurihara, Masazumi
    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 221 - 225
  • [4] Universally Weakly Secure Coset Coding Schemes for Minimum Storage Regenerating (MSR) Codes
    Kadhe, Swanand
    Sprintson, Alex
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 25 - 30
  • [5] Shortened Polar Codes
    Miloslavskaya, Vera
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (09) : 4852 - 4865
  • [6] SHORTENED BCH CODES
    HELGERT, HJ
    STINAFF, RD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (06) : 818 - 820
  • [7] Shortened Regenerating Codes
    Duursma, Iwan M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (02) : 1000 - 1007
  • [8] Clay Codes: Moulding MDS Codes to Yield an MSR Code
    Vajha, Myna
    Ramkumar, Vinayak
    Puranik, Bhagyashree
    Kini, Ganesh
    Lobo, Elita
    Sasidharan, Birenjith
    Kumar, P. Vijay
    Barg, Alexander
    Ye, Min
    Narayanamurthy, Srinivasan
    Hussain, Syed
    Nandi, Siddhartha
    PROCEEDINGS OF THE 16TH USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES, 2018, : 139 - 153
  • [9] SHORTENED FINITE GEOMETRY CODES
    LIN, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (05) : 692 - +
  • [10] SHORTENED FINITE GEOMETRY CODES
    CHEN, CL
    INFORMATION AND CONTROL, 1972, 20 (03): : 216 - &