LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

New results on multilevel diversity coding with secure regeneration

Photo from wikipedia

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 et al.… Click to show full 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 et 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 (defined as the type II compromised nodes) but only the data contents of the remaining compromised nodes (defined as the type I compromised nodes), as long as the number of type I compromised nodes is no greater than that of type II compromised nodes.

Keywords: compromised nodes; diversity coding; regeneration; coding secure; secure regeneration; multilevel diversity

Journal Title: Science China Information Sciences
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.