Can linear minimum storage regenerating codes be universally secure?

Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank

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

3 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationConference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
PublisherIEEE Computer Society
Pages549-553
Number of pages5
Volume2016-February
ISBN (Electronic)9781467385763
DOIs
StatePublished - Feb 26 2016
Externally publishedYes
Event49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: Nov 8 2015Nov 11 2015

Other

Other49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
CountryUnited States
CityPacific Grove
Period11/8/1511/11/15

Fingerprint

Information systems

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Goparaju, S., El Rouayheb, S., & Calderbank, R. (2016). Can linear minimum storage regenerating codes be universally secure? In Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 (Vol. 2016-February, pp. 549-553). [7421189] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421189
Goparaju, Sreechakra ; El Rouayheb, Salim ; Calderbank, Robert. / Can linear minimum storage regenerating codes be universally secure?. Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. Vol. 2016-February IEEE Computer Society, 2016. pp. 549-553
@inproceedings{a6861ed6e2354b2d89f7324eea042ba1,
title = "Can linear minimum storage regenerating codes be universally secure?",
abstract = "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.",
author = "Sreechakra Goparaju and {El Rouayheb}, Salim and Robert Calderbank",
year = "2016",
month = "2",
day = "26",
doi = "https://doi.org/10.1109/ACSSC.2015.7421189",
language = "English (US)",
volume = "2016-February",
pages = "549--553",
booktitle = "Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015",
publisher = "IEEE Computer Society",
address = "United States",

}

Goparaju, S, El Rouayheb, S & Calderbank, R 2016, Can linear minimum storage regenerating codes be universally secure? in Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. vol. 2016-February, 7421189, IEEE Computer Society, pp. 549-553, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/8/15. https://doi.org/10.1109/ACSSC.2015.7421189

Can linear minimum storage regenerating codes be universally secure? / Goparaju, Sreechakra; El Rouayheb, Salim; Calderbank, Robert.

Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. Vol. 2016-February IEEE Computer Society, 2016. p. 549-553 7421189.

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

TY - GEN

T1 - Can linear minimum storage regenerating codes be universally secure?

AU - Goparaju, Sreechakra

AU - El Rouayheb, Salim

AU - Calderbank, Robert

PY - 2016/2/26

Y1 - 2016/2/26

N2 - 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.

AB - 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.

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

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

U2 - https://doi.org/10.1109/ACSSC.2015.7421189

DO - https://doi.org/10.1109/ACSSC.2015.7421189

M3 - Conference contribution

VL - 2016-February

SP - 549

EP - 553

BT - Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

PB - IEEE Computer Society

ER -

Goparaju S, El Rouayheb S, Calderbank R. Can linear minimum storage regenerating codes be universally secure? In Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. Vol. 2016-February. IEEE Computer Society. 2016. p. 549-553. 7421189 https://doi.org/10.1109/ACSSC.2015.7421189