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

Submitted by BrandonB on Thu, 04/30/2015 - 11:40am

Title	Optimality of the product-matrix construction for secure MSR regenerating codes
Publication Type	Conference Paper
Year of Publication	2014
Authors	Sasidharan, B., Kumar, P.V., Shah, N.B., Rashmi, K.V., Ramachandran, K.
Conference Name	Communications, Control and Signal Processing (ISCCSP), 2014 6th International Symposium on
Date Published	May
Keywords	Bandwidth, Data collection, data file, eavesdropper, encoding, Entropy, exact repair regenerating code security, maintenance engineering, matrix algebra, minimum storage regenerating point, MSR codes, MSR point, product matrix, product matrix construction, product-matrix construction, Random variables, regenerating codes, repair traffic, secure MSR regenerating codes, Secure regenerating codes, security, Upper bound
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 l1 nodes as well as all the repair traffic entering a second disjoint set of l2 nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l2 d - k + 1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.
URL	http://ieeexplore.ieee.org/document/6877804/
DOI	10.1109/ISCCSP.2014.6877804
Citation Key	6877804

Groups:

Science of Security VO