Individual secrecy for the broadcast channel

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. A general achievable rate region is established by utilizing Marton's coding together with techniques such as rate splitting, Carleial-Hellman's secrecy coding, Wyner's secrecy coding and indirect decoding. Moreover, the individual secrecy capacity regions for some special cases are characterized, and an linear deterministic instance is exhibited to provide insights into the capacity regions under different secrecy constraints.