Secure locally repairable codes for distributed storage systems

Ankit Singh Rawat; O. Ozan Koyluoglu; Natalia Silberstein; Sriram Vishwanath

doi:10.1109/ISIT.2013.6620621

Secure locally repairable codes for distributed storage systems

Ankit Singh Rawat, O. Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

This paper presents coding schemes for distributed storage systems (DSS) that are secure against eavesdroppers, while simultaneously enabling efficient node repair (regeneration). Towards this, novel upper bounds on secrecy capacity for minimum storage regenerating (MSR) codes and locally repairable codes (LRCs) are derived. The eavesdropper model considered in this paper incorporates the ability to listen in on data downloaded during ℓ₂ node repairs in addition to content stored on ℓ₁ nodes. Finally, this paper presents coding schemes, based on precoding using Gabidulin codes, that achieve the upper bounds on secrecy capacity and characterize the secrecy capacity of DSS for various settings of system parameters.

Original language	English (US)
Title of host publication	2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages	2224-2228
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2013.6620621
State	Published - 2013
Externally published	Yes
Event	2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: Jul 7 2013 → Jul 12 2013

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Other

Other	2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/Territory	Turkey
City	Istanbul
Period	7/7/13 → 7/12/13

Keywords

Coding for distributed storage systems
locally repairable codes
minimum storage regenerating codes
security

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2013.6620621

Cite this

Secure locally repairable codes for distributed storage systems. / Rawat, Ankit Singh; Koyluoglu, O. Ozan; Silberstein, Natalia et al.
2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 2224-2228 6620621 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Rawat, AS, Koyluoglu, OO, Silberstein, N & Vishwanath, S 2013, Secure locally repairable codes for distributed storage systems. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620621, IEEE International Symposium on Information Theory - Proceedings, pp. 2224-2228, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620621

@inproceedings{710468370c5342808364f664c8635823,

title = "Secure locally repairable codes for distributed storage systems",

abstract = "This paper presents coding schemes for distributed storage systems (DSS) that are secure against eavesdroppers, while simultaneously enabling efficient node repair (regeneration). Towards this, novel upper bounds on secrecy capacity for minimum storage regenerating (MSR) codes and locally repairable codes (LRCs) are derived. The eavesdropper model considered in this paper incorporates the ability to listen in on data downloaded during ℓ2 node repairs in addition to content stored on ℓ1 nodes. Finally, this paper presents coding schemes, based on precoding using Gabidulin codes, that achieve the upper bounds on secrecy capacity and characterize the secrecy capacity of DSS for various settings of system parameters.",

keywords = "Coding for distributed storage systems, locally repairable codes, minimum storage regenerating codes, security",

author = "Rawat, {Ankit Singh} and Koyluoglu, {O. Ozan} and Natalia Silberstein and Sriram Vishwanath",

year = "2013",

doi = "10.1109/ISIT.2013.6620621",

language = "English (US)",

isbn = "9781479904464",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2224--2228",

booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",

}

TY - GEN

T1 - Secure locally repairable codes for distributed storage systems

AU - Rawat, Ankit Singh

AU - Koyluoglu, O. Ozan

AU - Silberstein, Natalia

AU - Vishwanath, Sriram

PY - 2013

Y1 - 2013

N2 - This paper presents coding schemes for distributed storage systems (DSS) that are secure against eavesdroppers, while simultaneously enabling efficient node repair (regeneration). Towards this, novel upper bounds on secrecy capacity for minimum storage regenerating (MSR) codes and locally repairable codes (LRCs) are derived. The eavesdropper model considered in this paper incorporates the ability to listen in on data downloaded during ℓ2 node repairs in addition to content stored on ℓ1 nodes. Finally, this paper presents coding schemes, based on precoding using Gabidulin codes, that achieve the upper bounds on secrecy capacity and characterize the secrecy capacity of DSS for various settings of system parameters.

AB - This paper presents coding schemes for distributed storage systems (DSS) that are secure against eavesdroppers, while simultaneously enabling efficient node repair (regeneration). Towards this, novel upper bounds on secrecy capacity for minimum storage regenerating (MSR) codes and locally repairable codes (LRCs) are derived. The eavesdropper model considered in this paper incorporates the ability to listen in on data downloaded during ℓ2 node repairs in addition to content stored on ℓ1 nodes. Finally, this paper presents coding schemes, based on precoding using Gabidulin codes, that achieve the upper bounds on secrecy capacity and characterize the secrecy capacity of DSS for various settings of system parameters.

KW - Coding for distributed storage systems

KW - locally repairable codes

KW - minimum storage regenerating codes

KW - security

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

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

U2 - 10.1109/ISIT.2013.6620621

DO - 10.1109/ISIT.2013.6620621

M3 - Conference contribution

AN - SCOPUS:84890360123

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2224

EP - 2228

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -

Secure locally repairable codes for distributed storage systems

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this