Individual Secrecy for the Broadcast Channel

This paper studies the problem of secure communications 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 rate from
each
message to the eavesdropper is made vanishing). Building upon Carleial–Hellman’s secrecy coding, Wyner’s secrecy coding, and the framework of Marton’s coding together with techniques, such as rate splitting and indirect decoding, an achievable individual secrecy rate region is established with the characterization of capacity regions for some special cases. In particular, the individual secrecy capacity region for the linear deterministic model is fully characterized, and for the Gaussian model, a constant gap (i.e., 0.5 b within the individual secrecy capacity region) result is obtained. To illustrate the impact of different secrecy constraints on the corresponding capacity regions, comparisons are made with those satisfying joint secrecy and without secrecy constraints. Overall, when compared with the joint secrecy constraint, the results allow for trading off secrecy level and throughput in the system.