Show simple item record

dc.contributor.authorTandon, Ravi
dc.contributor.authorAmuru, SaiDhiraj
dc.contributor.authorClancy, T. Charles
dc.contributor.authorBuehrer, R. Michael
dc.date.accessioned2018-07-19T16:54:24Z
dc.date.available2018-07-19T16:54:24Z
dc.date.issued2014-02
dc.identifier.urihttp://hdl.handle.net/10919/84198
dc.description.abstractDistributed storage systems (DSS) in the presence of a passive eavesdropper are considered in this paper. A typical DSS is characterized by 3 parameters (n, k, d) where, a file is stored in a distributed manner across n nodes such that it can be recovered entirely from any k out of n nodes. Whenever a node fails, d ∈ [k, n) nodes participate in the repair process. In this paper, we study the exact repair capabilities of a DSS, where a failed node is replaced with its exact replica. Securing this DSS from a passive eavesdropper capable of wiretapping the repair process of any l < k nodes, is the main focus of this paper. Specifically, we characterize the optimal secure storagevs- exact-repair-bandwidth tradeoff region for the (4, 2, 3) DSS when l = 1 and the (n, n − 1, n − 1) DSS when l = n − 2.
dc.language.isoen_US
dc.publisherIEEE
dc.relation.ispartofInformation Theory and Applications Workshop (ITA), 2014
dc.titleDistributed Storage Systems with Secure and Exact Repair - New Results
dc.typeConference proceeding
dc.typePresentation
dc.identifier.doihttps://doi.org/10.1109/ita.2014.6804226


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record