On the Tradeoff Region of Secure Exact-Repair Regenerating Codes

DOI10.1109/TIT.2017.2750156zbMATH Open1390.94885arXiv1701.03023MaRDI QIDQ4566558FDOQ4566558

Authors: Shuo Shao, Tie Liu, Chao Tian, Cong Shen 

Publication date: 27 June 2018

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

Abstract: We consider the $(n,k,d,ell)$ secure exact-repair regenerating code problem, which generalizes the $(n,k,d)$ exact-repair regenerating code problem with the additional constraint that the stored file needs to be kept information-theoretically secure against an eavesdropper, who can access the data transmitted to regenerate a total of $ell$ different failed nodes. For all known results on this problem, the achievable tradeoff regions between the normalized storage capacity and repair bandwidth have a single corner point, achieved by a scheme proposed by Shah, Rashmi and Kumar (the SRK point). Since the achievable tradeoff regions of the exact-repair regenerating code problem without any secrecy constraints are known to have multiple corner points in general, these existing results suggest a phase-change-like behavior, i.e., enforcing a secrecy constraint ($ellgeq1$) immediately reduces the tradeoff region to one with a single corner point. In this work, we first show that when the secrecy parameter $ell$ is sufficiently large, the SRK point is indeed the only corner point of the tradeoff region. However, when $ell$ is small, we show that the tradeoff region can in fact have multiple corner points. In particular, we establish a precise characterization of the tradeoff region for the $(7,6,6,1)$ problem, which has exactly two corner points. Thus, a smooth transition, instead of a phase-change-type of transition, should be expected as the secrecy constraint is gradually strengthened.

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

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cited In (4)

• Codes for Distributed Storage
• Secure Erasure Codes With Partial Reconstructibility
• Security Concerns in Minimum Storage Cooperative Regenerating Codes
• An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Cooperative Regenerating Codes

This page was built for publication: On the Tradeoff Region of Secure Exact-Repair Regenerating Codes

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