3-Receiver broadcast channels with common and confidential messages

Chia, Yeow-Khiang; Gamal, Abbas El

doi:10.1109/isit.2009.5205421

Cited by 29 publications

(56 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This resembles the idea of indirect decoding of Nair and El Gamal [29]. Applying FME gives the following lower bound on R 0 which subsumes the lower bound given in [27] under weak secrecy criterion:…”

Section: It Yieldsmentioning

confidence: 78%

“…We now compare our lower bound with the one given in [27]. The lower bound given in [27] is the maximum of…”

Section: It Yieldsmentioning

confidence: 96%

“…If one only wants to securely transmit a common message M 0 as in [27] (i.e. R 1 = R 2 = 0), the second inequality of the (43) can be neglected, because it is sufficient to recover M 0 through only U n 0 ; it is not necessary to make sure that we do not make any error in decoding U n 1 and U n 2 (the efficacy of using U 1 and U 2 without decoding them has been clarified in [27]). This resembles the idea of indirect decoding of Nair and El Gamal [29].…”

Section: It Yieldsmentioning

confidence: 99%

“…This is because given any (Q, U 0 , U 1 , U 2 , X) where the Markov chain does not hold we can replace U 0 with (U 0 , Q) and find a new set of random variables where the Markov chain holds and the inner bound expression remains unchanged. To sum this up, the lower bound of [27] can be rewritten as the maximum of…”

Section: It Yieldsmentioning

confidence: 99%

See 3 more Smart Citations

Achievability Proof via Output Statistics of Random Binning

Yassaee

Aref

Gohari

2014

IEEE Trans. Inform. Theory

138

200

View full text Add to dashboard Cite

This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Further, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one to add an eavesdropper and obtain a result on the secrecy rates "for free."We make a case for generality of the framework by studying examples in the variety of settings containing channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to hybrid coding scheme. Also, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish achievability results for coordination problems including interactive channel simulation, coordination via relay and channel simulation via another channel.

show abstract

Section: It Yieldsmentioning

confidence: 78%

“…We now compare our lower bound with the one given in [27]. The lower bound given in [27] is the maximum of…”

Section: It Yieldsmentioning

confidence: 96%

Section: It Yieldsmentioning

confidence: 99%

Section: It Yieldsmentioning

confidence: 99%

See 2 more Smart Citations

Achievability Proof via Output Statistics of Random Binning

Yassaee

Aref

Gohari

2014

IEEE Trans. Inform. Theory

138

200

View full text Add to dashboard Cite

show abstract

“…In [41], the compound wiretap channel with two legitimate users and one eavesdropper, i.e., K Y = 2 and K Z = 1, is considered, and the following achievable secrecy rate is provided.…”

Section: Compound Wiretap Channelsmentioning

confidence: 99%

Secure broadcasting using multiple antennas

Ekrem

Ulukuş

2010

J. Commun. Netw.

View full text Add to dashboard Cite

Abstract:We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multi-receiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing information-theoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multiple-input multiple-output (MIMO) channel models. We also present the existing results for the more general discrete memoryless channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models.Index Terms: Broadcast channels, information theoretic security, multiple antennas.

show abstract