On block security of regenerating codes at the MBR point for distributed storage systems
- 1 June 2014
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1967-1971
- https://doi.org/10.1109/isit.2014.6875177
Abstract
A passive adversary can eavesdrop stored content or downloaded content of some storage nodes, in order to learn illegally about the file stored across a distributed storage system (DSS). Previous work in the literature focuses on code constructions that trade storage capacity for perfect security. In other words, by decreasing the amount of original data that it can store, the system can guarantee that the adversary, which eavesdrops up to a certain number of storage nodes, obtains no information (in Shannon's sense) about the original data. In this work we introduce the concept of block security for DSS and investigate minimum bandwidth regenerating (MBR) codes that are block secure against adversaries of varied eavesdropping strengths. Such MBR codes guarantee that no information about any group of original data units up to a certain size is revealed, without sacrificing the storage capacity of the system. The size of such secure groups varies according to the number of nodes that the adversary can eavesdrop. We show that code constructions based on Cauchy matrices provide block security. The opposite conclusion is drawn for codes based on Vandermonde matrices.Keywords
Other Versions
This publication has 13 references indexed in Scilit:
- Secure locally repairable codes for distributed storage systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Data secrecy in distributed storage systems under exact repairPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Regenerating codes for errors and erasures in distributed storagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- On the Security of Index Coding With Side InformationIEEE Transactions on Information Theory, 2012
- Information-Theoretically Secure Regenerating Codes for Distributed StoragePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix ConstructionIEEE Transactions on Information Theory, 2011
- Security in distributed storage systems by communicating a logarithmic number of bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Explicit construction of optimal exact regenerating codes for distributed storagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Universal weakly secure network codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Maintenance-free global data storageIEEE Internet Computing, 2001