Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks

Details Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks

2010-09-14

arxiv.org/abs/1009.2556v2

Computer Science

Information Theory

37 pages, 11 figures, submitted to IT transactions

Scientific paper

We address the problem of securing distributed storage systems against eavesdropping and adversarial attacks. An important aspect of these systems is node failures over time, necessitating, thus, a repair mechanism in order to maintain a desired high system reliability. In such dynamic settings, an important security problem is to safeguard the system from an intruder who may come at different time instances during the lifetime of the storage system to observe and possibly alter the data stored on some nodes. In this scenario, we give upper bounds on the maximum amount of information that can be stored safely on the system. For an important operating regime of the distributed storage system, which we call the 'bandwidth-limited regime', we show that our upper bounds are tight and provide explicit code constructions. Moreover, we provide a way to short list the malicious nodes and expurgate the system.

Affiliated with

Also associated with

No associations

Rating

Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394921