Secure Symmetrical Multilevel Diversity Coding

Symmetrical multilevel diversity coding (SMDC) is a network compression problem introduced by Roche (1992) and Yeung (1995). In this setting, a simple separate encoding strategy known as superposition coding was shown to be optimal in terms of achieving the minimum sum rate (Roche-Yeung-Hau 1997) an...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2013-06, Vol.59 (6), p.3572-3581
Main Authors: Balasubramanian, A., Ly, H. D., Shuo Li, Tie Liu, Miller, S. L.
Format: Article
Language:English
Subjects:
Applied sciences
Buildings
Coding theory
Cryptography
Decoding
Electronic eavesdropping
Encoding
Exact sciences and technology
Geometry
Information theory
Information, signal and communications theory
Information-theoretic security
Mathematical problems
multilevel diversity coding
Network security
rate region
Receivers
Secret
secure network coding
Signal and communications theory
subset entropy inequality
Switching and signalling
Symmetry
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Tin
USA Councils
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Symmetrical multilevel diversity coding (SMDC) is a network compression problem introduced by Roche (1992) and Yeung (1995). In this setting, a simple separate encoding strategy known as superposition coding was shown to be optimal in terms of achieving the minimum sum rate (Roche-Yeung-Hau 1997) and the entire admissible rate region (Yeung-Zhang 1999) of the general problem. This paper considers a natural generalization of SMDC to the secure communication setting with an additional eavesdropper. It is required that all sources need to be kept perfectly secret from the eavesdropper as long as the number of encoder outputs available at the eavesdropper is no more than a given threshold. First, the problem of encoding individual sources is studied. A precise characterization of the entire admissible rate region is established via a connection to the problem of ramp-type secret sharing (Yamamoto 1985 and Blakley-Meadows 1985) and utilizing some basic polyhedral structure of the admissible rate region. Building on this result, it is then shown that superposition coding remains optimal in terms of achieving the minimum sum rate for the general secure SMDC problem.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2245395