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

arXiv:1903.04463 · IEEE International Symposium on Information Theory (ISIT)

Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel

Farzin Salek, Min-Hsiu Hsieh, J.R. Fonollosa

Published Jul 1, 2019• 9 citations
arXivHTMLPDF

Abstract

The 2-receiver broadcast channel with primary and third-party receivers is studied. The messages are classified into public, private and confidential. The messages in the public class are messages intended for both receivers. The private messages are intended for the primary receiver with no secrecy requirements imposed upon them. And the confidential messages are aimed exclusively to the primary receiver such that they must not be accessible to the other receiver. The encoder performs the necessary encryption by virtue of local randomness whose rate is assumed to be limited. We find an achievability region on the trade-off between the rates of the three messages and the source of randomness in the one-shot regime of a quantum broadcast channel.

DOI
10.1109/isit.2019.8849633

Related papers

Single-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages

Farzin Salek, Min-Hsiu Hsieh, J.R. Fonollosa

The two-receiver broadcast channel with primary and third party receivers is studied. The sender wishes to reliably communicate a common (or public) message to both receivers as well as individualized and confidential messages to the primary receiver only. The third party receiver must be kept completely ignorant of the confidential message but there are no secrecy requirements associated to the individualized message. A trade-off arises between the rates of the three messages: when one of the rates is high, the other rates may need to back off to guarantee the reliable transmission of all three messages. In addition, the confidentiality requirement implies availability of local randomness at the transmitter in order to implement a stochastic encoding. This article studies the trade-off between the rates of the common, individualized and confidential messages as well as that of the local randomness in the one-shot regime of a quantum broadcast channel. We provide an achievability region, by proving a conditional version of the convex-split lemma combined with the position-based decoding, as well as a (weak) converse region. We study the asymptotic behaviour of our bounds and recover several well-known asymptotic results in the literature, including simultaneous transmission of classical and quantum information.

IEEE Transactions on Information Theory•Jul 30, 2020•8 citations

Physical layer security in broadcast networks

Yingbin Liang, H. Vincent Poor, Shlomo Shitz Shamai

Abstract This paper reviews the information theoretic characterization of security in broadcast channels, in which a transmitter has both public and confidential messages intended for multiple receivers. All messages must be successfully received by their intended receivers, and the confidential messages must be kept as secret as possible from non‐intended recipients. Various scenarios are considered in the context of two‐user broadcast channels, for which known results on the secrecy capacity region are reviewed and corresponding coding schemes for achieving rates in these regions are described. Copyright © 2009 John Wiley & Sons, Ltd.

Security and Communication Networks•May 1, 2009•41 citations

3-Receiver broadcast channels with common and confidential messages

Yeow-Khiang Chia, Abbas El Gamal

Achievable secrecy rate regions for the general 3-receiver broadcast channel with one common and one confidential message sets are established. We consider two setups: (i) when the confidential message is to be sent to two of the receivers and the third receiver is an eavesdropper; and (ii) when the confidential message is to be sent to one of the receivers and the other two receivers are eavesdroppers. We show that our secrecy rate regions are optimum for some special cases.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•29 citations

MIMO Gaussian broadcast channels with private and confidential messages and with receiver side information

Rafael F. Schaefer, H. Vincent Poor, Holger Boche

In this paper the two-receiver MIMO Gaussian broadcast channel with private and confidential messages and receiver side information is studied. In this communication scenario, each receiver is interested in one private and one confidential message having the other private message as side information for decoding available. Each confidential message is exclusively intended for one receiver and must therefore be kept secret from the other receiver. A complete characterization of the secrecy capacity region is established using channel enhancement arguments and an extremal entropy inequality.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2013•0 citations

Quantum Broadcast Channels with Mutually Confidential Messages

Paula Belzig, Sukanya Ghosal, Farzin Salek +1 more

We study the transmission of two independent confidential classical messages over a quantum broadcast channel, one for each receiver. Each message must remain secret from the other receiver, including when that receiver knows its own message. For classical inputs and quantum outputs, we establish the classical Marton-type inner bound under average reliability and conditional strong secrecy. The encoder selects pairs of codewords from independently generated codebooks using normalized likelihood weights. We prove reliability through a change-of-distribution argument. Our main technical result is a bipartite classical-quantum resolvability theorem that accounts for the dependence created by pair selection and establishes secrecy for the same encoder. We also obtain a multi-letter capacity characterization and extend it to arbitrary quantum inputs under secrecy against the other receiver, together with the Stinespring environment. We recover confidential capacity regions for deterministic classical and degraded classical-quantum channels, with an explicit evaluation for the classical Blackwell channel. For coherent isometric extensions of injective deterministic classical broadcast channels, we show that the confidential classical capacity region equals that of the corresponding classical channel. We then compare confidential classical communication with quantum transmission. For the coherent isometric extension of the Blackwell channel, we determine the unassisted quantum-capacity region and show that some achievable confidential classical rate pairs lie outside it. The Platypus channel provides another example of this separation.

quant-pharXiv:2609.26750•Sep 23, 2026•2 citations

Three-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 three-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•IEEE Transactions on Information Theory•Jan 31, 2012•68 citations
The 2-receiver broadcast channel with primary and third-party receivers is studied. The messages are classified into public, private and confidential. The messages in the public class are messages intended for both receivers. The private messages are intended for the primary receiver with no secrecy requirements imposed upon them. And the confidential messages are aimed exclusively to the primary receiver such that they must not be accessible to the other receiver. The encoder performs the necessary encryption by virtue of local randomness whose rate is assumed to be limited. We find an achievability region on the trade-off between the rates of the three messages and the source of randomness in the one-shot regime of a quantum broadcast channel.
The two-receiver broadcast channel with primary and third party receivers is studied. The sender wishes to reliably communicate a common (or public) message to both receivers as well as individualized and confidential messages to the primary receiver only. The third party receiver must be kept completely ignorant of the confidential message but there are no secrecy requirements associated to the individualized message. A trade-off arises between the rates of the three messages: when one of the rates is high, the other rates may need to back off to guarantee the reliable transmission of all three messages. In addition, the confidentiality requirement implies availability of local randomness at the transmitter in order to implement a stochastic encoding. This article studies the trade-off between the rates of the common, individualized and confidential messages as well as that of the local randomness in the one-shot regime of a quantum broadcast channel. We provide an achievability region, by proving a conditional version of the convex-split lemma combined with the position-based decoding, as well as a (weak) converse region. We study the asymptotic behaviour of our bounds and recover several well-known asymptotic results in the literature, including simultaneous transmission of classical and quantum information.
Abstract This paper reviews the information theoretic characterization of security in broadcast channels, in which a transmitter has both public and confidential messages intended for multiple receivers. All messages must be successfully received by their intended receivers, and the confidential messages must be kept as secret as possible from non‐intended recipients. Various scenarios are considered in the context of two‐user broadcast channels, for which known results on the secrecy capacity region are reviewed and corresponding coding schemes for achieving rates in these regions are described. Copyright © 2009 John Wiley & Sons, Ltd.
In this paper the two-receiver MIMO Gaussian broadcast channel with private and confidential messages and receiver side information is studied. In this communication scenario, each receiver is interested in one private and one confidential message having the other private message as side information for decoding available. Each confidential message is exclusively intended for one receiver and must therefore be kept secret from the other receiver. A complete characterization of the secrecy capacity region is established using channel enhancement arguments and an extremal entropy inequality.
We study the transmission of two independent confidential classical messages over a quantum broadcast channel, one for each receiver. Each message must remain secret from the other receiver, including when that receiver knows its own message. For classical inputs and quantum outputs, we establish the classical Marton-type inner bound under average reliability and conditional strong secrecy. The encoder selects pairs of codewords from independently generated codebooks using normalized likelihood weights. We prove reliability through a change-of-distribution argument. Our main technical result is a bipartite classical-quantum resolvability theorem that accounts for the dependence created by pair selection and establishes secrecy for the same encoder. We also obtain a multi-letter capacity characterization and extend it to arbitrary quantum inputs under secrecy against the other receiver, together with the Stinespring environment. We recover confidential capacity regions for deterministic classical and degraded classical-quantum channels, with an explicit evaluation for the classical Blackwell channel. For coherent isometric extensions of injective deterministic classical broadcast channels, we show that the confidential classical capacity region equals that of the corresponding classical channel. We then compare confidential classical communication with quantum transmission. For the coherent isometric extension of the Blackwell channel, we determine the unassisted quantum-capacity region and show that some achievable confidential classical rate pairs lie outside it. The Platypus channel provides another example of this separation.
This paper establishes inner bounds on the secrecy capacity regions for the general three-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.