2008
DOI: 10.1109/tit.2008.921861
|View full text |Cite
|
Sign up to set email alerts
|

Secure Broadcasting Over Fading Channels

Abstract: Abstract-We study a problem of broadcasting confidential messages to multiple receivers under an information-theoretic secrecy constraint. Two scenarios are considered: 1) all receivers are to obtain a common message; and 2) each receiver is to obtain an independent message. Moreover, two models are considered: parallel channels and fast-fading channels.For the case of reversely degraded parallel channels, one eavesdropper, and an arbitrary number of legitimate receivers, we determine the secrecy capacity for … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
256
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 248 publications
(261 citation statements)
references
References 26 publications
5
256
0
Order By: Relevance
“…On the contrary, (29) of this paper may have infinite solutions for p Y |Z (y|z) but we prove that none of them is a valid solution because (29) does not hold good as z c → ∞; 2) To disprove 3) in [19,Section IV], the authors establish the impossibility of γ = 0 by proposing a family of distributions with strictly monotonically increasing mutual information, whereas to disprove (49), we exploit the fact that the capacity is non-negative; 3) In [19], the authors establish that the mutual information is strictly concave in F . Our result on concavity relies on [23] which does not establish strict concavity. Consequently we do not pursue the problem of establishing uniqueness of the input distribution in this work.…”
Section: ) Its Support Contains An Interval;mentioning
confidence: 84%
“…On the contrary, (29) of this paper may have infinite solutions for p Y |Z (y|z) but we prove that none of them is a valid solution because (29) does not hold good as z c → ∞; 2) To disprove 3) in [19,Section IV], the authors establish the impossibility of γ = 0 by proposing a family of distributions with strictly monotonically increasing mutual information, whereas to disprove (49), we exploit the fact that the capacity is non-negative; 3) In [19], the authors establish that the mutual information is strictly concave in F . Our result on concavity relies on [23] which does not establish strict concavity. Consequently we do not pursue the problem of establishing uniqueness of the input distribution in this work.…”
Section: ) Its Support Contains An Interval;mentioning
confidence: 84%
“…In [23], the secrecy rate over MU-MIMO broadcasting channels was well studied. In [24], a robust beamforming scheme for MU-MIMO downlink networks was proposed by using a Bayesian approach.…”
Section: A Related Workmentioning
confidence: 99%
“…From (23), it is known that ε is a monotonously increasing function of M−1 M and R. Given a requirement on the outage probability ε, the sum secrecy outage capacity R is maximized by minimizing …”
Section: Appendix B Proof Of Theoremmentioning
confidence: 99%
“…For the broadcast multi-users scenario, Csiszár and Körner extended the original wiretap channel, proposed by Wyner, to the case where the source sends common information to both the destination and the eavesdropper while the confidential messages are sent only to the destination. The secrecy capacity of this scenario, for the case of a broadcast wiretap channel with parallel and fading channels assuming perfect main CSI at the transmitter, was considered in [20]. For the multiple access scenario, the authors in [21] investigated the secrecy capacity of a degraded channel where the eavesdropper obtains a degraded version of the receiver's signal.…”
Section: Introductionmentioning
confidence: 99%