Improving the Secrecy of Distributed Storage Systems using Interference Alignment

01/05/2018
by   Natasa Paunkoska, et al.
0

Regenerating codes based on the approach of interference alignment for wireless interference channel achieve the cut-set bound for distributed storage systems. These codes provide data reliability, and perform efficient exact node repair when some node fails. Interference alignment as a concept is especially important to improve the repair efficiency of a failed node in a minimum storage regenerating (MSR) code. In addition it can improve the stored data security in presence of passive intruders. In this paper we construct a new code resilient against a threat model where a passive eavesdropper can access the data stored on a subset of nodes and the downloaded data during the repair process of a subset of failed nodes. We achieve an optimal secrecy capacity for the new explicit construction of MSR interference alignment code. Hence, we show that the eavesdropper obtains zero information from the original message stored across the distributed storage, and that we achieve a perfect secrecy.

READ FULL TEXT
research
01/02/2022

Secure Determinant Codes for Distributed Storage Systems

The information-theoretic secure exact-repair regenerating codes for dis...
research
02/26/2019

Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values

This paper addresses the problem of constructing secure exact-repair reg...
research
01/15/2020

Secrecy and Accessibility in Distributed Storage

A distributed storage system (DSS) needs to be efficiently accessible an...
research
05/04/2018

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size

The repair problem in distributed storage addresses recovery of the data...
research
03/29/2021

Explicit Construction of Minimum Storage Rack-Aware Regenerating Codes for All Parameters

We consider the rack-aware storage system where n=n̅u nodes are organize...
research
11/02/2022

Node repair on connected graphs, Part II

We continue our study of regenerating codes in distributed storage syste...
research
04/24/2018

On the Secrecy Capacity of a Full-Duplex Wirelessly Powered Communication System in the Presence of a Passive Eavesdropper

In this paper, we investigate the secrecy capacity of a point-to-point, ...

Please sign up or login with your details

Forgot password? Click here to reset