On Secrecy Capacity of Minimum Storage Regenerating Codes

DOI10.1109/TIT.2016.2647601MaRDI QIDQ5280849zbMATH OpenOpenAlexFDO

Authors Kun Huang, Udaya Parampalli, Ming Xian

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.01986

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Abstract: In this paper, we revisit the problem of characterizing the secrecy capacity of minimum storage regenerating (MSR) codes under the passive $(l_1,l_2)$-eavesdropper model, where the eavesdropper has access to data stored on $l_1$ nodes and the repair data for an additional $l_2$ nodes. We study it from the information-theoretic perspective. First, some general properties of MSR codes as well as a simple and generally applicable upper bound on secrecy capacity are given. Second, a new concept of emph{stable} MSR codes is introduced, where the stable property is shown to be closely linked with secrecy capacity. Finally, a comprehensive and explicit result on secrecy capacity in the linear MSR scenario is present, which generalizes all related works in the literature and also predicts certain results for some unexplored linear MSR codes.

Cited in

(2)

• Security Concerns in Minimum Storage Cooperative Regenerating Codes
• Codes for Distributed Storage

This page was built for publication: On Secrecy Capacity of Minimum Storage Regenerating Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280849)