Secure shortened MSR codes
Nataša Paunkoska, Ninoslav Marina, Weiler A. Finamore, Jovan Karamachoski · 2017
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.