2014/05/12 by Swanand Kadhe, Kadhe, Swanand, Alex Sprintson +1 · 1 citation
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1405.2894
Extended version of the paper accepted in NetCod 2014
arxiv created 2014/05/12 · openalex publication_date 2014/05/12 · arxiv updated 2014/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the problem of secure distributed data storage under the paradigm of weak security, in which no meaningful information is leaked to the eavesdropper. More specifically, the eavesdropper cannot get any information about any individual message file or a small group of files. The key benefit of the weak security paradigm is that it incurs no loss in the storage capacity, which makes it practically appealing. In this paper, we present a coding scheme, using a coset coding based outer code and a Product-Matrix Minimum Bandwidth Regenerating code (proposed by Rashmi et al.) as an inner code, that achieves weak security when the eavesdropper can observe any single storage node. We show that the proposed construction has good security properties and requires small finite field size.