Individual Secrecy for the Broadcast Channel
From MaRDI portal
Publication:4589421
DOI10.1109/TIT.2017.2694552zbMATH Open1374.94821OpenAlexW2605451066MaRDI QIDQ4589421FDOQ4589421
Authors: Yanling Chen, O. Ozan Koyluoglu, Aydin Sezgin 
Publication date: 10 November 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage from each message to the eavesdropper is made vanishing). Building upon Carleial-Hellman's secrecy coding, Wyner's secrecy coding, the frameworks of superposition coding and Marton's coding together with techniques such as rate splitting and indirect decoding, achievable rate regions are developed. The proposed regions are compared with those satisfying joint secrecy and without secrecy constraints, and the individual secrecy capacity regions for special cases are characterized. In particular, capacity region for the deterministic case is established, and for the Gaussian model, a constant gap (i.e., 0.5 bits within the individual secrecy capacity region) result is obtained. Overall, when compared with the joint secrecy constraint, the results allow for trading-off secrecy level and throughput in the system.
Full work available at URL: https://arxiv.org/abs/1511.09070
Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)
This page was built for publication: Individual Secrecy for the Broadcast Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589421)
