Abstract
In a distributed storage system, regenerating codes can be utilized to ensure data availability. This reduces the repair bandwidth but increases the risk of data eavesdropping on each node. Previous studies in this area generally only provided an approximate analysis of the security of schemes with information-theoretic security or weak security. Some researchers have further divided weak security into block security; however, they only analyzed several the regenerating codes schemes and proposed improved schemes with specific eavesdropping capabilities. In this study, we analyze the block security of a Cauchy-matrix-based product-matrix minimum storage regenerating(MSR) scheme and determine the optimal block security of MSR codes. Lastly, an improved MSR codes scheme for achieving optimal block security is proposed, and the relevant proof is provided.
Highlights
In a distributed system, the regenerating codes scheme [1], [2] has a low repair communication bandwidth; it relies on communication with multiple nodes for data repair and reconstruction
OPTIMAL WEAKLY SECURE MSR CODES SCHEME we propose an improved scheme based on PM-MSR codes to optimize weak security, called optimal weakly secure PM-MSR (OWSPM-MSR) codes
In this study, we evaluate the weak security of a Cauchymatrix-based PM-MSR codes scheme under different parameters, demonstrating that (2α − l)-block security against an eavesdropper with parameter l(l < k) can be achieved
Summary
The regenerating codes scheme [1], [2] has a low repair communication bandwidth; it relies on communication with multiple nodes for data repair and reconstruction. Bian et al.: Optimal Weakly Secure MSR Codes Scheme regenerating code that reaches the boundary when an eavesdropper can obtain data from more than one node This scheme meets the security requirement by inserting random data; the storage utilization rate rapidly decreases. Oliveira et al [17] proposed a scheme for encoding and storing the data in a decentralized manner using the Vandermonde matrix This scheme enabled the system to reach a weak security standard; it did not consider eavesdropping of communication lines, and had a high repair bandwidth. Compared with existing secure regenerating codes schemes, we provide two main contributions in this study: 1) We present a simple method for analyzing the weak security of the MSR scheme based on the rank of the generating matrix.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
