Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Allerton Conference on Communication, Control, and Computing

On the secrecy capacity region of a class of parallel Wiretap Broadcast Channel

Meryem Benammar, Pablo Piantanida

Published Sep 1, 2014• 0 citations
Publisher

Abstract

This work investigates the secrecy capacity region of a class of Wiretap Broadcast Channel (WBC) where a source wishes to send two independent messages to two receivers in the presence of an external eavesdropper. We focus on the class of parallel WBC and more precisely on the product of two reversely less-noisy BC with a more noisy eavesdropper. We fully characterize the capacity region of such a setting through a novel powerful outer bound that relies on a careful single letter expression, followed by a non-trivial equivalent formulation of the resulting rate region. This outer bound turns out to be tight with the inner bound we derive for the setting under study.

DOI
10.1109/allerton.2014.7028574

Related papers

Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels

Meryem Benammar, Pablo Piantanida

This paper investigates the secrecy capacity of the wiretap broadcast channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a broadcast channel (BC) while keeping them secret from the eavesdropper. We derive a nontrivial outer bound on the secrecy capacity region of this channel which, in absence of security constraints, reduces to the best known outer bound to the capacity of the standard BC. An inner bound is also derived, which follows the behavior of both the best known inner bound for the BC and the wiretap channel. These bounds are shown to be tight for the deterministic BC with a general eavesdropper, the semideterministic BC with a more noisy eavesdropper, and the wiretap BC where users exhibit a less noisiness order between them. Finally, by rewriting our outer bound to encompass the characteristics of parallel channels, we also derive the secrecy capacity region of the product of two inversely less noisy BCs with a more noisy eavesdropper. We illustrate our results by studying the impact of security constraints on the capacity of the WBC with binary erasure and binary symmetric components.

arXiv:1407.5572•IEEE Transactions on Information Theory•Jul 31, 2015•24 citations

On the secrecy capacity region of the Wiretap Broadcast Channel

Meryem Benammar, Pablo Piantanida

This work investigates the secrecy capacity region of the Wiretap Broadcast Channel (WBC) where an encoder communicates two private messages over a Broadcast Channel (BC) while keeping both messages secret from the eavesdropper. Our main result is the derivation of a novel outer bound and an inner bound on the secrecy capacity region of this setting. These results allow us to characterize the capacity region for three non-degraded classes of WBCs: the deterministic and the semi-deterministic WBC with a more noisy eavesdropper, and the WBC when users exhibit less noisiness order between them.

IEEE Information Theory Workshop (ITW)•Nov 1, 2014•2 citations

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 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.

EURASIP Journal on Wireless Communications and Networking•Aug 6, 2009•94 citations

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.0319•Dec 1, 2008•2 citations

On secure broadcasting

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.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Oct 1, 2008•18 citations

3-Receiver Broadcast Channels with Common and Confidential Messages

Yeow-Khiang Chia, Abbas El Gamal

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be sent to two receivers and kept secret from the third receiver. Achievability is established using indirect decoding, Wyner wiretap channel coding, and the new idea of generating secrecy from a publicly available superposition codebook. The inner bound is shown to be tight for a class of reversely degraded broadcast channels and when both legitimate receivers are less noisy than the third receiver. The second setup investigated in this paper is when the confidential message is to be sent to one receiver and kept secret from the other two receivers. Achievability in this case follows from Wyner wiretap channel coding and indirect decoding. This inner bound is also shown to be tight for several special cases.

arXiv:0910.1407•Oct 8, 2009•2 citations
This work investigates the secrecy capacity region of a class of Wiretap Broadcast Channel (WBC) where a source wishes to send two independent messages to two receivers in the presence of an external eavesdropper. We focus on the class of parallel WBC and more precisely on the product of two reversely less-noisy BC with a more noisy eavesdropper. We fully characterize the capacity region of such a setting through a novel powerful outer bound that relies on a careful single letter expression, followed by a non-trivial equivalent formulation of the resulting rate region. This outer bound turns out to be tight with the inner bound we derive for the setting under study.
This paper investigates the secrecy capacity of the wiretap broadcast channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a broadcast channel (BC) while keeping them secret from the eavesdropper. We derive a nontrivial outer bound on the secrecy capacity region of this channel which, in absence of security constraints, reduces to the best known outer bound to the capacity of the standard BC. An inner bound is also derived, which follows the behavior of both the best known inner bound for the BC and the wiretap channel. These bounds are shown to be tight for the deterministic BC with a general eavesdropper, the semideterministic BC with a more noisy eavesdropper, and the wiretap BC where users exhibit a less noisiness order between them. Finally, by rewriting our outer bound to encompass the characteristics of parallel channels, we also derive the secrecy capacity region of the product of two inversely less noisy BCs with a more noisy eavesdropper. We illustrate our results by studying the impact of security constraints on the capacity of the WBC with binary erasure and binary symmetric components.
This work investigates the secrecy capacity region of the Wiretap Broadcast Channel (WBC) where an encoder communicates two private messages over a Broadcast Channel (BC) while keeping both messages secret from the eavesdropper. Our main result is the derivation of a novel outer bound and an inner bound on the secrecy capacity region of this setting. These results allow us to characterize the capacity region for three non-degraded classes of WBCs: the deterministic and the semi-deterministic WBC with a more noisy eavesdropper, and the WBC when users exhibit less noisiness order between them.
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.
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.
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.
This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be sent to two receivers and kept secret from the third receiver. Achievability is established using indirect decoding, Wyner wiretap channel coding, and the new idea of generating secrecy from a publicly available superposition codebook. The inner bound is shown to be tight for a class of reversely degraded broadcast channels and when both legitimate receivers are less noisy than the third receiver. The second setup investigated in this paper is when the confidential message is to be sent to one receiver and kept secret from the other two receivers. Achievability in this case follows from Wyner wiretap channel coding and indirect decoding. This inner bound is also shown to be tight for several special cases.