Information-theoretically secure regenerating codes for distributed storage

Shah, Nihar B and Rashmi, KV and Kumar, Vijay P (2011) Information-theoretically secure regenerating codes for distributed storage. In: 2011 IEEE Global Telecommunications Conference (GLOBECOM 2011), 5-9 Dec. 2011, Houston, TX, USA.

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

Abstract

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security. In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes. We provide explicit constructions of regenerating codes that achieve information-theoretic secrecy capacity in this setting.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright of this article belongs to IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	14 Mar 2013 09:49
Last Modified:	14 Mar 2013 09:49
URI:	http://eprints.iisc.ac.in/id/eprint/46051

Actions (login required)

View Item