Title :
Security in locally repairable storage
Author :
Agarwal, Abhishek ; Mazumdar, Arya
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
fDate :
April 26 2015-May 1 2015
Abstract :
In this paper we extend the notion of locally repairable codes to secret sharing schemes. The main problem we consider is to find the optimal ways to distribute shares of a secret among a set of storage-nodes (participants) such that the content of each node (share) can be recovered by using contents of only few other nodes, and at the same time the secret can be reconstructed by only some allowable subsets of nodes. As a special case, an eavesdropper observing some set of a specified nodes (such as less than certain number of nodes) does not get any information. In other words, we propose to study a locally repairable distributed storage system that is secure against a passive eavesdropper that can observe some subsets of nodes. We provide a number of results related to such systems including upper-bounds and achievability results on the number of bits that can be securely stored with these constraints.
Keywords :
security of data; storage allocation; locally repairable code; locally repairable storage; passive eavesdropper; repairable distributed storage system; secret sharing scheme; Cryptography; Decision support systems; Generators; Maintenance engineering; Polynomials; Secure storage;
Conference_Titel :
Information Theory Workshop (ITW), 2015 IEEE
Conference_Location :
Jerusalem
Print_ISBN :
978-1-4799-5524-4
DOI :
10.1109/ITW.2015.7133116