Optimality of the product-matrix construction for secure MSR regenerating codes

B. Sasidharan; P. V. Kumar; N. B. Shah; K. V. Rashmi; K. Ramachandran

doi:10.1109/ISCCSP.2014.6877804

Optimality of the product-matrix construction for secure MSR regenerating codes

B. Sasidharan, P. V. Kumar, N. B. Shah, K. V. Rashmi, K. Ramachandran

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

6 Citations (Scopus)

Abstract

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of ℓ₁ nodes as well as all the repair traffic entering a second disjoint set of ℓ₂ nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever ℓ₂ ≤ d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

Original language	English
Title of host publication	ISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	10-14
Number of pages	5
ISBN (Print)	9781479928903
DOIs	https://doi.org/10.1109/ISCCSP.2014.6877804
Publication status	Published - 2014
Externally published	Yes
Event	IEEE International Symposium on Control, Communications and Signal Processing (ISCCSP) 2014 - Athens, Greece Duration: 21 May 2014 → 23 May 2014 Conference number: 6th https://ieeexplore.ieee.org/xpl/conhome/6862736/proceeding (Proceedings)

Conference

Conference	IEEE International Symposium on Control, Communications and Signal Processing (ISCCSP) 2014
Abbreviated title	ISCCSP 2014
Country/Territory	Greece
City	Athens
Period	21/05/14 → 23/05/14
Internet address	https://ieeexplore.ieee.org/xpl/conhome/6862736/proceeding (Proceedings)

Keywords

MSR codes
product-matrix construction
regenerating codes
Secure regenerating codes

Access to Document

10.1109/ISCCSP.2014.6877804

Cite this

Sasidharan, B., Kumar, P. V., Shah, N. B., Rashmi, K. V., & Ramachandran, K. (2014). Optimality of the product-matrix construction for secure MSR regenerating codes. In ISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings (pp. 10-14). IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISCCSP.2014.6877804

@inproceedings{fff0232d67044c66a061bc838b8ef88c,

title = "Optimality of the product-matrix construction for secure MSR regenerating codes",

abstract = "In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of ℓ1 nodes as well as all the repair traffic entering a second disjoint set of ℓ2 nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever ℓ2 ≤ d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.",

keywords = "MSR codes, product-matrix construction, regenerating codes, Secure regenerating codes",

author = "B. Sasidharan and Kumar, {P. V.} and Shah, {N. B.} and Rashmi, {K. V.} and K. Ramachandran",

year = "2014",

doi = "10.1109/ISCCSP.2014.6877804",

language = "English",

isbn = "9781479928903",

pages = "10--14",

booktitle = "ISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States of America",

note = "IEEE International Symposium on Control, Communications and Signal Processing (ISCCSP) 2014, ISCCSP 2014 ; Conference date: 21-05-2014 Through 23-05-2014",

url = "https://ieeexplore.ieee.org/xpl/conhome/6862736/proceeding",

}

Sasidharan, B, Kumar, PV, Shah, NB, Rashmi, KV & Ramachandran, K 2014, Optimality of the product-matrix construction for secure MSR regenerating codes. in ISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings. IEEE, Institute of Electrical and Electronics Engineers, pp. 10-14, IEEE International Symposium on Control, Communications and Signal Processing (ISCCSP) 2014, Athens, Greece, 21/05/14. https://doi.org/10.1109/ISCCSP.2014.6877804

Optimality of the product-matrix construction for secure MSR regenerating codes. / Sasidharan, B.; Kumar, P. V.; Shah, N. B. et al.
ISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings. IEEE, Institute of Electrical and Electronics Engineers, 2014. p. 10-14.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Optimality of the product-matrix construction for secure MSR regenerating codes

AU - Sasidharan, B.

AU - Kumar, P. V.

AU - Shah, N. B.

AU - Rashmi, K. V.

AU - Ramachandran, K.

N1 - Conference code: 6th

PY - 2014

Y1 - 2014

N2 - In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of ℓ1 nodes as well as all the repair traffic entering a second disjoint set of ℓ2 nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever ℓ2 ≤ d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

AB - In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of ℓ1 nodes as well as all the repair traffic entering a second disjoint set of ℓ2 nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever ℓ2 ≤ d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

KW - MSR codes

KW - product-matrix construction

KW - regenerating codes

KW - Secure regenerating codes

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

U2 - 10.1109/ISCCSP.2014.6877804

DO - 10.1109/ISCCSP.2014.6877804

M3 - Conference Paper

AN - SCOPUS:84906761333

SN - 9781479928903

SP - 10

EP - 14

BT - ISCCSP 2014 - 2014 6th International Symposium on Communications, Control and Signal Processing, Proceedings

PB - IEEE, Institute of Electrical and Electronics Engineers

T2 - IEEE International Symposium on Control, Communications and Signal Processing (ISCCSP) 2014

Y2 - 21 May 2014 through 23 May 2014

ER -

Optimality of the product-matrix construction for secure MSR regenerating codes

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this