Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits

Details Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits

2010-05-04

arxiv.org/abs/1005.0426v1

Computer Science

Cryptography and Security

Scientific paper

We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a simple linear hashing scheme to detect errors in the storage nodes. Our main result is that for storing a data object of total size $\size$ using an $(n,k)$ MDS code over a finite field $\F_q$, up to $t_1=\lfloor(n-k)/2\rfloor$ errors can be detected, with probability of failure smaller than $1/ \size$, by communicating only $O(n(n-k)\log \size)$ bits to a trusted verifier. Our result constructs small projections of the data that preserve the errors with high probability and builds on a pseudorandom generator that fools linear functions. The transmission rate achieved by our scheme is asymptotically equal to the min-cut capacity between the source and any receiver.

Affiliated with

Also associated with

No associations

Rating

Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits 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 Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-531030