127
44

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

Abstract

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\size using an (n,k)(n,k) MDS code over a finite field \Fq\F_q, up to t1=(nk)/2t_1=\lfloor(n-k)/2\rfloor errors can be detected, with probability of failure smaller than 1/\size1/ \size, by communicating only O(n(nk)log\size)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.

View on arXiv
Comments on this paper

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.