TY - GEN
T1 - K-user degraded broadcast channel with secrecy outside a bounded range
AU - Zou, Shaofeng
AU - Liang, Yingbin
AU - Lai, Lifeng
AU - Poor, H. Vincent
AU - Shamai, Shlomo
N1 - Funding Information:
The work of S. Zou and Y. Liang was supported by a National Science Foundation CAREER Award under Grant CCF-10-26565. The work of L. Lai was supported by a National Science Foundation CAREER Award under Grant CCF-13-18980 and the National Science Foundation under Grant ECCS-14-08114. The work of H. V. Poor was supported by the National Science Foundation under Grant CMMI-1435778. The work of S. Shamai (Shitz) was supported by the Israel Science Foundation (ISF).
Publisher Copyright:
© 2016 IEEE.
PY - 2016/10/21
Y1 - 2016/10/21
N2 - A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wk should be kept secure from receivers with two-level worse channel quality, i.e., receivers 1,., k-2. The secrecy capacity region is fully characterized. The achievable scheme designates one superposition layer to each message with random binning employed for each layer for protecting all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can potentially be shared with its immediate upper-layer message to enlarge the rate region. More importantly, an induction approach is developed to perform Fourier-Motzkin elimination over 2K variables among Θ(K2) bounds to obtain a close-form achievable rate region. A converse proof is developed that matches the achievable rate region, which involves recursive construction of the rate bounds.
AB - A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wk should be kept secure from receivers with two-level worse channel quality, i.e., receivers 1,., k-2. The secrecy capacity region is fully characterized. The achievable scheme designates one superposition layer to each message with random binning employed for each layer for protecting all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can potentially be shared with its immediate upper-layer message to enlarge the rate region. More importantly, an induction approach is developed to perform Fourier-Motzkin elimination over 2K variables among Θ(K2) bounds to obtain a close-form achievable rate region. A converse proof is developed that matches the achievable rate region, which involves recursive construction of the rate bounds.
UR - http://www.scopus.com/inward/record.url?scp=84998812003&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84998812003&partnerID=8YFLogxK
U2 - 10.1109/ITW.2016.7606790
DO - 10.1109/ITW.2016.7606790
M3 - Conference contribution
AN - SCOPUS:84998812003
T3 - 2016 IEEE Information Theory Workshop, ITW 2016
SP - 31
EP - 35
BT - 2016 IEEE Information Theory Workshop, ITW 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Information Theory Workshop, ITW 2016
Y2 - 11 September 2016 through 14 September 2016
ER -