EURASIP Journal on Wireless Communications and Networking

Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper

Ersen Ekrem, Şennur Ulukuş

Published Aug 6, 2009• 94 citations

Abstract

We study the security of communication between a single transmitter and many receivers in the presence of an eavesdropper for several special classes of broadcast channels. As the first model, we consider the degraded multireceiver wiretap channel where the legitimate receivers exhibit a degradedness order while the eavesdropper is more noisy with respect to all legitimate receivers. We establish the secrecy capacity region of this channel model. Secondly, we consider the parallel multireceiver wiretap channel with a less noisiness order in each subchannel, where this order is not necessarily the same for all subchannels, and hence the overall channel does not exhibit a less noisiness order. We establish the common message secrecy capacity and sum secrecy capacity of this channel. Thirdly, we study a class of parallel multireceiver wiretap channels with two subchannels, two users and an eavesdropper. For channels in this class, in the first (resp., second) subchannel, the second (resp., first) receiver is degraded with respect to the first (resp., second) receiver, while the eavesdropper is degraded with respect to both legitimate receivers in both subchannels. We determine the secrecy capacity region of this channel, and discuss its extensions to arbitrary numbers of users and subchannels. Finally, we focus on a variant of this previous channel model where the transmitter can use only one of the subchannels at any time. We characterize the secrecy capacity region of this channel as well.

DOI: 10.1155/2009/824235

Related papers

Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper

Ersen Ekrem, Şennur Ulukuş

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the degraded multi-receiver wiretap channel where the legitimate receivers exhibit a degradedness order while the eavesdropper is more noisy with respect to all legitimate receivers. We establish the secrecy capacity region of this channel model. Secondly, we consider the parallel multi-receiver wiretap channel with a less noisiness order in each sub-channel, where this order is not necessarily the same for all sub-channels. We establish the common message secrecy capacity and sum secrecy capacity of this channel. Thirdly, we study a special class of degraded parallel multi-receiver wiretap channels and provide a stronger result. In particular, we study the case with two sub-channels two users and one eavesdropper, where there is a degradedness order in each sub-channel such that in the first (resp. second) sub-channel the second (resp. first) receiver is degraded with respect to the first (resp. second) receiver, while the eavesdropper is degraded with respect to both legitimate receivers in both sub-channels. We determine the secrecy capacity region of this channel. Finally, we focus on a variant of this previous channel model where the transmitter can use only one of the sub-channels at any time. We characterize the secrecy capacity region of this channel as well.

arXiv:0812.0319Dec 1, 20082 citations

On secure broadcasting

Ersen Ekrem, Şennur Ulukuş

Asilomar Conference on Signals, Systems and Computers (ACSSC)Oct 1, 200818 citations

The individual secrecy capacity of degraded multi-receiver wiretap broadcast channels

Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche

We study secure communication over a degraded wiretap broadcast channel with multiple receivers and an eavesdropper. We consider two different secrecy measures: the traditional joint secrecy where the mutual information leakage of all messages must be small; and individual secrecy where the sum of the information leakage of each individual message must be small. At first, we investigate the joint secrecy criterion, where we present the capacity region established before and provide a simpler converse proof. We then consider the individual secrecy criterion and establish its capacity region, by combining the techniques of wiretap random coding and Shannon's one time pad principle. Our results indicate that the individual secrecy capacity region is bigger than the joint one. Further, we show that the established capacity regions are valid for any degraded wiretap broadcast channel, regardless of the degradedness order of the eavesdropper. Finally, we extend our results to Gaussian channels.

International Conference on CommunicationsJun 1, 201517 citations

On secure broadcasting over parallel channels with independent secret keys

Rafael F. Schaefer, Ashish J. Khisti, H. Vincent Poor

The broadcast channel with independent secret keys models a communication scenario in which a common message has to be securely broadcast to two legitimate receivers keeping an eavesdropper ignorant of it.The transmitter shares an independent secret key of arbitrary rate with each legitimate receiver.Depending on the channel qualities of the legitimate receivers and the eavesdropper, these secret keys must be used as one-time pads to encrypt the message, as fictitious messages for randomization in wiretap coding, or a combination of both to achieve the secrecy capacity.In this paper, communication takes place over independent parallel subchannels and the secrecy capacity is established for these cases, in which all parallel channels follow the same order of degradation.

Jan 1, 20160 citations

Secrecy capacity region of the degraded compound multi-receiver wiretap channel

Ersen Ekrem, Şennur Ulukuş

We study the degraded compound multi-receiver wiretap channel, which consists of two groups of users and a group of eavesdroppers. We consider two different communication scenarios. In both scenarios, the transmitter sends two confidential messages, one for each group of users. In the first scenario, both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multi-input multi-output (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario, the message sent to the first group of users needs to be kept confidential from both the second group of users and eavesdroppers, whereas the message sent to the second group of users needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. We find the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we obtain the secrecy capacity region when there is only one user in the second group.

Allerton Conference on Communication, Control, and ComputingSep 1, 200912 citations

Secure Broadcasting

Ashish J. Khisti, Aslan Tchamkerten, Gregory W. Wornell

Wyner's wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended receivers, and one eavesdropper. We study the situations where the sender broadcasts either a common message or independent messages to the intended receivers. We derive upper and lower bounds on the common-message-secrecy capacity, which coincide when the users are reversely degraded. For the case of independent messages we establish the secrecy sum-capacity when the users are reversely degraded. In the second part of the paper we apply our results to fading channels: perfect channel state information of all intended receivers is known globally, whereas the eavesdropper channel is known only to her. For the common message case, a somewhat surprising result is proven: a positive rate can be achieved independently of the number of intended receivers. For independent messages, an opportunistic transmission scheme is presented that achieves the secrecy sum-capacity in the limit of large number of receivers. Our results are stated for a fast fading channel model. Extensions to the block fading model are also discussed.

arXiv:cs/0702093Feb 16, 200720 citations