Data secrecy in distributed storage systems under exact repair
Authors:
- 1 June 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23749660,p. 1-6
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 amount of data that can be stored securely decreases exponentially with the number of compromised nodes. Whether this exponential decrease is fundamental or is a consequence of the exactness and linearity constraints remains an open question.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Regenerating codes for errors and erasures in distributed storage2012
- Access vs. bandwidth in codes for storage2012
- Secure Network Coding for Wiretap Networks of Type IIIEEE Transactions on Information Theory, 2012
- Information-Theoretically Secure Regenerating Codes for Distributed Storage2011
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth TradeoffIEEE Transactions on Information Theory, 2011
- Securing dynamic distributed storage systems from malicious nodes2011
- Secure Network Coding on a Wiretap NetworkIEEE Transactions on Information Theory, 2010
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Wire-Tap Channel IIAT&T Bell Laboratories Technical Journal, 1984
- How to share a secretCommunications of the ACM, 1979