The secrecy capacity of the semi-deterministic broadcast channel

Authors:
Wei Kang;Nan Liu
Affiliations:
School of Information Science and Engineering, Southeast University, Nanjing, China;School of Information Science and Engineering, Southeast University, Nanjing, China
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 10
Cited 0

Elements of information theory

Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Secrecy capacity of a class of broadcast channels with an eavesdropper

EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Capacity bounds for broadcast channels with confidential messages

IEEE Transactions on Information Theory
Codes with the identifiable parent property and the multiple-access channel

General Theory of Information Transfer and Combinatorics
Multiple-Access Channels With Confidential Messages

IEEE Transactions on Information Theory
Secure Broadcasting Over Fading Channels

IEEE Transactions on Information Theory
Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions

IEEE Transactions on Information Theory
The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming

IEEE Transactions on Information Theory
The Relay–Eavesdropper Channel: Cooperation for Secrecy

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study secure communications over a two-user semi-deterministic broadcast channel, i.e., one of the receivers is connected to the transmitter through a deterministic channel. We consider the case where the deterministic receiver is also the eavesdropper for the other receiver's message. We derive the secrecy capacity region by showing that superposition encoding plus Gel'fand-Pinsker encoding is optimal. We find that due to the deterministic component of the channel, Gel'fand-Pinsker binning alone is enough to achieve perfect secrecy. We also compare our scheme with the capacity-achieving scheme of Marton for the semi-deterministic broadcast channel where there is no secrecy constraint.