2011/07/26 by Nihar B. Shah, Shah, Nihar B., K. V. Rashmi +3
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.IT #cs.NI #math.IT
paper · pdf · doi:10.48550/arxiv.1107.5279
Globecom 2011
arxiv created 2011/07/26 · openalex publication_date 2011/07/26 · arxiv updated 2015/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.