Secure locally repairable codes for distributed storage systems

Ankit Singh Rawat, Onur Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath

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

2 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2224-2228
Number of pages5
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

Fingerprint

Storage System
Distributed Systems
Repair
Vertex of a graph
Coding
Upper bound
Precoding
Regeneration
Model

Keywords

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

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Rawat, A. S., Koyluoglu, O. O., Silberstein, N., & Vishwanath, S. (2013). Secure locally repairable codes for distributed storage systems. In IEEE International Symposium on Information Theory - Proceedings (pp. 2224-2228). [6620621] https://doi.org/10.1109/ISIT.2013.6620621

Secure locally repairable codes for distributed storage systems. / Rawat, Ankit Singh; Koyluoglu, Onur Ozan; Silberstein, Natalia; Vishwanath, Sriram.

IEEE International Symposium on Information Theory - Proceedings. 2013. p. 2224-2228 6620621.

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

Rawat, AS, Koyluoglu, OO, Silberstein, N & Vishwanath, S 2013, Secure locally repairable codes for distributed storage systems. in IEEE International Symposium on Information Theory - Proceedings., 6620621, 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
Rawat AS, Koyluoglu OO, Silberstein N, Vishwanath S. Secure locally repairable codes for distributed storage systems. In IEEE International Symposium on Information Theory - Proceedings. 2013. p. 2224-2228. 6620621 https://doi.org/10.1109/ISIT.2013.6620621
Rawat, Ankit Singh ; Koyluoglu, Onur Ozan ; Silberstein, Natalia ; Vishwanath, Sriram. / Secure locally repairable codes for distributed storage systems. IEEE International Symposium on Information Theory - Proceedings. 2013. pp. 2224-2228
@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, {Onur Ozan} and Natalia Silberstein and Sriram Vishwanath",
year = "2013",
doi = "10.1109/ISIT.2013.6620621",
language = "English (US)",
isbn = "9781479904464",
pages = "2224--2228",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Secure locally repairable codes for distributed storage systems

AU - Rawat, Ankit Singh

AU - Koyluoglu, Onur 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

SN - 9781479904464

SP - 2224

EP - 2228

BT - IEEE International Symposium on Information Theory - Proceedings

ER -