Data Secrecy in Distributed Storage Systems under Exact Repair
Preprint 2013 en
Authors
SG
Sreechakra Goparaju
SR
Salim El Rouayheb
RC
Robert Calderbank
Abstract
1 min read
The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The maximum file size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree $d=n-1$, where $n$ is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the maximum secure file size for systems with $d
Discussion(0)
No comments yet. Be the first to comment.