Skip to main content

Degraded Broadcast Channel with Secrecy Outside a Bounded Range

Author(s): Zou, Shaofeng; Liang, Yingbin; Lai, Lifeng; Poor, H Vincent; Shamai, Shlomo

To refer to this page use:
Abstract: The K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode message W 1 , ..., W k , for 1 ≤ k ≤ K, and to be kept ignorant of W k+2 , .. ., W K , fork = 1, ..., K -2. Thus, each message W k is kept secure from receivers with at least 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 binning employed for each layer. Joint embedded coding and binning are employed to protect 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 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 of 2 K variables from the order of K 2 bounds to obtain a close-form achievable rate region. An outer bound is developed that matches the achievable rate region, whose proof involves recursive construction of the rate bounds and exploits the intuition gained from the achievable scheme.
Publication Date: Mar-2018
Citation: Zou, S., Liang, Y., Lai, L., Poor, H. V., & Shitz, S. S. (2018). Degraded broadcast channel with secrecy outside a bounded range. IEEE Transactions on Information Theory, 64(3), 2104-2120. doi:10.1109/TIT.2018.2791995
DOI: doi:10.1109/ITW.2015.7133081
ISSN: 0018-9448
EISSN: 1557-9654
Pages: 2104-2120
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Transactions on Information Theory
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.