OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

Sasidharan, B and Kumar, PV and Shah, NB and Rashmi, KV and Ramachandran, K (2014) OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES. In: 6th International Symposium on Communications, Control and Signal Processing (ISCCSP), MAY 21-23, 2014, Athens, GREECE, pp. 10-14.

PDF int_sym_com_con_sig_pro_10_2014.pdf - Published Version Restricted to Registered users only Download (109kB) | Request a copy

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 l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(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.

Item Type:	Conference Proceedings
Publisher:	IEEE
Additional Information:	Copyright for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Keywords:	Secure regenerating codes; regenerating codes; MSR codes; product-matrix construction
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	21 Jan 2015 06:43
Last Modified:	21 Jan 2015 06:43
URI:	http://eprints.iisc.ac.in/id/eprint/50735

Actions (login required)

View Item