English

New Results on Multilevel Diversity Coding with Secure Regeneration

Information Theory 2018-01-15 v1 math.IT

Abstract

The problem of multilevel diversity coding with secure regeneration is revisited. Under the assumption that the eavesdropper can access the repair data for all compromised storage nodes, Shao el al. provided a precise characterization of the minimum-bandwidth-regeneration (MBR) point of the achievable normalized storage-capacity repair-bandwidth tradeoff region. In this paper, it is shown that the MBR point of the achievable normalized storage-capacity repair-bandwidth tradeoff region remains the same even if we assume that the eavesdropper can access the repair data for some compromised storage nodes (type 2 compromised nodes) but only the data contents of the remaining compromised nodes (type 1 compromised nodes), as long as the number of type 1 compromised nodes is no greater than that of type 2 compromised nodes.

Keywords

Cite

@article{arxiv.1801.03931,
  title  = {New Results on Multilevel Diversity Coding with Secure Regeneration},
  author = {Shuo Shao and Tie Liu and Chao Tian and Cong Shen},
  journal= {arXiv preprint arXiv:1801.03931},
  year   = {2018}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1712.03326

R2 v1 2026-06-22T23:43:05.256Z