Distributed storage systems with secure and exact repair - New results

Ravi Tandon; Sai Dhiraj Amuru; T. Charles Clancy; R. Michael Buehrer

doi:10.1109/ITA.2014.6804226

Distributed storage systems with secure and exact repair - New results

Ravi Tandon, Sai Dhiraj Amuru, T. Charles Clancy, R. Michael Buehrer

Research output: Contribution to conference › Paper › peer-review

5 Scopus citations

Abstract

Distributed 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 storage-vs-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.

Original language	English (US)
DOIs	https://doi.org/10.1109/ITA.2014.6804226
State	Published - 2014
Externally published	Yes
Event	2014 IEEE Information Theory and Applications Workshop, ITA 2014 - San Diego, CA, United States Duration: Feb 9 2014 → Feb 14 2014

Other

Other	2014 IEEE Information Theory and Applications Workshop, ITA 2014
Country/Territory	United States
City	San Diego, CA
Period	2/9/14 → 2/14/14

ASJC Scopus subject areas

Computer Science Applications
Information Systems

Access to Document

10.1109/ITA.2014.6804226

Cite this

@conference{0eee8a4d70134a4f8315e1077db8d00d,

title = "Distributed storage systems with secure and exact repair - New results",

abstract = "Distributed 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 storage-vs-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.",

author = "Ravi Tandon and Amuru, {Sai Dhiraj} and Clancy, {T. Charles} and Buehrer, {R. Michael}",

year = "2014",

doi = "10.1109/ITA.2014.6804226",

language = "English (US)",

note = "2014 IEEE Information Theory and Applications Workshop, ITA 2014 ; Conference date: 09-02-2014 Through 14-02-2014",

}

TY - CONF

T1 - Distributed storage systems with secure and exact repair - New results

AU - Tandon, Ravi

AU - Amuru, Sai Dhiraj

AU - Clancy, T. Charles

AU - Buehrer, R. Michael

PY - 2014

Y1 - 2014

N2 - Distributed 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 storage-vs-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.

AB - Distributed 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 storage-vs-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.

UR - http://www.scopus.com/inward/record.url?scp=84901227903&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901227903&partnerID=8YFLogxK

U2 - 10.1109/ITA.2014.6804226

DO - 10.1109/ITA.2014.6804226

M3 - Paper

AN - SCOPUS:84901227903

T2 - 2014 IEEE Information Theory and Applications Workshop, ITA 2014

Y2 - 9 February 2014 through 14 February 2014

ER -

Distributed storage systems with secure and exact repair - New results

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this