Can linear minimum storage regenerating codes be universally secure?

Conference Paper

© 2015 IEEE. We study the problem of making a distributed storage system information-theoretically secure against a passive eavesdropper, and aim to characterize coding schemes that are universally secure for up to a given number of eavesdropped nodes. Specifically, we consider minimum storage regenerating (MSR) codes and ask the following question: For an MSR code where a failed node is repaired using all the remaining nodes, is it possible to simultaneously be optimally secure using a single linear coding scheme? We define a pareto-optimality associated with this simultaneity and show that there exists at least one linear coding scheme that is pareto-optimal.

Full Text

Duke Authors

Cited Authors

  • Goparaju, S; Rouayheb, SE; Calderbank, R

Published Date

  • February 26, 2016

Published In

Volume / Issue

  • 2016-February /

Start / End Page

  • 549 - 553

International Standard Serial Number (ISSN)

  • 1058-6393

International Standard Book Number 13 (ISBN-13)

  • 9781467385763

Digital Object Identifier (DOI)

  • 10.1109/ACSSC.2015.7421189

Citation Source

  • Scopus