Security in locally repairable storage

Abhishek Agarwal, Arya Mazumdar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479955268
DOIs
StatePublished - Jun 24 2015
Event2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel
Duration: Apr 26 2015May 1 2015

Publication series

Name2015 IEEE Information Theory Workshop, ITW 2015

Other

Other2015 IEEE Information Theory Workshop, ITW 2015
CountryIsrael
CityJerusalem
Period4/26/155/1/15

Cite this