Can linear minimum storage regenerating codes be universally secure?
Publication
, Conference
Goparaju, S; Rouayheb, SE; Calderbank, R
Published in: Conference Record - Asilomar Conference on Signals, Systems and Computers
February 26, 2016
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.
Duke Scholars
Published In
Conference Record - Asilomar Conference on Signals, Systems and Computers
DOI
ISSN
1058-6393
Publication Date
February 26, 2016
Volume
2016-February
Start / End Page
549 / 553
Citation
APA
Chicago
ICMJE
MLA
NLM
Goparaju, S., Rouayheb, S. E., & Calderbank, R. (2016). Can linear minimum storage regenerating codes be universally secure? In Conference Record - Asilomar Conference on Signals, Systems and Computers (Vol. 2016-February, pp. 549–553). https://doi.org/10.1109/ACSSC.2015.7421189
Goparaju, S., S. E. Rouayheb, and R. Calderbank. “Can linear minimum storage regenerating codes be universally secure?” In Conference Record - Asilomar Conference on Signals, Systems and Computers, 2016-February:549–53, 2016. https://doi.org/10.1109/ACSSC.2015.7421189.
Goparaju S, Rouayheb SE, Calderbank R. Can linear minimum storage regenerating codes be universally secure? In: Conference Record - Asilomar Conference on Signals, Systems and Computers. 2016. p. 549–53.
Goparaju, S., et al. “Can linear minimum storage regenerating codes be universally secure?” Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2016-February, 2016, pp. 549–53. Scopus, doi:10.1109/ACSSC.2015.7421189.
Goparaju S, Rouayheb SE, Calderbank R. Can linear minimum storage regenerating codes be universally secure? Conference Record - Asilomar Conference on Signals, Systems and Computers. 2016. p. 549–553.
Published In
Conference Record - Asilomar Conference on Signals, Systems and Computers
DOI
ISSN
1058-6393
Publication Date
February 26, 2016
Volume
2016-February
Start / End Page
549 / 553