Data Secrecy in Distributed Storage Systems under Exact Repair
Authors:
- Sreechakra GoparajuSGSreechakra Goparaju
- Salim El RouayhebSRSalim El Rouayheb
- Robert CalderbankRCRobert Calderbank
- H. Vincent PoorH. Vincent Poor
Preprint
Abstract
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<n-1$. The key ingredients for the contribution of this paper are new results on subspace intersection for the data downloaded during repair. The new bounds imply the interesting fact that the maximum data that can be stored securely decreases exponentially with the number of compromised nodes.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Optimal Locally Repairable and Secure Codes for Distributed Storage SystemsIEEE Transactions on Information Theory, 2013
- Zigzag Codes: MDS Array Codes With Optimal RebuildingIEEE Transactions on Information Theory, 2012
- Secure Network Coding for Wiretap Networks of Type IIIEEE Transactions on Information Theory, 2012
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code ConstructionsIEEE Transactions on Information Theory, 2011
- Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial AttacksIEEE Transactions on Information Theory, 2011
- A Survey on Network Codes for Distributed StorageProceedings of the IEEE, 2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010