Optimal locally repairable and secure codes for distributed storage systems

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

Research output: Contribution to journalArticlepeer-review

187 Scopus citations


This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSSs). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, security, and local-repairability in these systems. In particular, this paper first investigates security in the presence of colluding eavesdroppers, where eavesdroppers are assumed to work together in decoding the stored information. Second, this paper focuses on coding schemes that enable optimal local repairs. It further brings these two concepts together to develop locally repairable coding schemes for DSS that are secure against eavesdroppers. The main results of this paper include: 1) an improved bound on the secrecy capacity for minimum storage regenerating codes; 2) secure coding schemes that achieve the bound for some special cases; 3) a new bound on minimum distance for locally repairable codes; 4) code construction for locally repairable codes that attain the minimum distance bound; and 5) repair-bandwidth-efficient locally repairable codes with and without security constraints.

Original languageEnglish
Article number6655894
Pages (from-to)212-236
Number of pages25
JournalIEEE Transactions on Information Theory
Issue number1
StatePublished - 1 Jan 2014
Externally publishedYes


  • Coding for distributed storage systems
  • locally repairable codes
  • repair bandwidth efficient codes
  • security

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Optimal locally repairable and secure codes for distributed storage systems'. Together they form a unique fingerprint.

Cite this