#### DMCA

## 3-Receiver Broadcast Channels with Common and Confidential Messages (2009)

### Cached

### Download Links

Citations: | 19 - 4 self |

### Citations

740 |
Broadcast Channels with Confidential Messages
- Csiszar, Korner
- 1978
(Show Context)
Citation Context ...h is the optimal trade-off between the rate for reliable communication to the legitimate receiver and the eavesdropper's message equivocation rate. This result was later extended by Csiszar and Komer =-=[2]-=- to establish the secrecy capacity ofthe 2-receiver broadcast channel with one confidential message and one common message. In their setup, a common message is to be sent to both receivers and a confi... |

559 |
The wire-tap channel
- Wyner
- 1975
(Show Context)
Citation Context ... to be sent to one of the receivers and the other two receivers are eavesdroppers. We show that our secrecy rate regions are optimurn for some special cases. I. INTRODUCTION In a seminal paper, Wyner =-=[1]-=- introduced the wiretap channel, where a sender wishes to communicate a message to a receiver, while keeping the message secret from an eavesdropper. He established the secrecy capacity of the channel... |

159 | Discrete memoryless interference and broadcast channels with confidential messages: Secrecy rate regions
- Liu, Maric, et al.
(Show Context)
Citation Context ...e is to be sent only to the first receiver under a constraint on the second receiver's (eavesdropper) equivocation rate. More recent work following this direction includes the paper by Ruoheng et al. =-=[3]-=- in which inner and outer bounds on the secrecy capacity regions of both the broadcast and interference channels with independent confidential messages are established. Extending the result of Csiszar... |

111 |
General broadcast channels with degraded message sets
- Körner, Marton
- 1977
(Show Context)
Citation Context ...not known in general. Recently, Nair and EI Gamal [4] showed that the straightforward extension of the Komer and Marton capacity region for the 2-receiver broadcast channel with degraded message sets =-=[5]-=- to more than 3 receivers is not optimal. They established an achievable rate region for the general 3-receiver broadcast channel and showed that it can be strictly larger than the straightforward ext... |

66 | Secure Broadcasting over fading channels
- Khisti, Tchamkerten, et al.
- 2008
(Show Context)
Citation Context ...broadcast channel with sender X == (Xl, X2... ,Xk), receivers }j == (}jl' }j2 ... , }jk) for j == 1, 2, 3, and conditional probability mass functions p(Yl' Y2, Y31x) == IT7= 1 p(YlZ, Y2Z, Y3zlxz). In =-=[7]-=-, it is shown that the secrecy rate R is achievable if k R < min L[1(Uz; }jz) - 1(Uz; Y3Z)]+ (1) jE{1,2} Z=l IT7= 1 p(uz)p(xzluz). Fur for some p(Ul, . . . ,Uk, x) == ther, this rate is shown to be o... |

34 |
The feedback capacity of degraded broadcast channels
- Gamal
- 1978
(Show Context)
Citation Context ...U3) - I(X; Y2IU3), R e3::; [I(V; Y11U3) - I(V; Y3IU3)]+ for some p(u, U3, V, x) == p(u)p(u3Iu)p(vlu3)p(xlv). The proof of this proposition uses a combination of standard converse techniques from [8], =-=[9]-=- and [2]. Using Propositions 1 and 2, we can establish the secrecy capacity region for the following special cases. 1) Y1 more capable than Y3 : If Y1 is more capable than Y3 , the capacity region is ... |

24 | Gamal “The Capacity Region of a Class of 3-Receiver Broadcast Channels with DegradedMessageSets
- Nair, El
- 2009
(Show Context)
Citation Context ...eceivers has remained open, since the capacity region (without secrecy constraints) of the 3-receiver broadcast channel with degraded message sets is not known in general. Recently, Nair and EI Gamal =-=[4]-=- showed that the straightforward extension of the Komer and Marton capacity region for the 2-receiver broadcast channel with degraded message sets [5] to more than 3 receivers is not optimal. They est... |

20 |
The capacity of a class of broadcast channels
- Gamal
- 1979
(Show Context)
Citation Context ...; Y11U3) - I(X; Y2IU3), R e3::; [I(V; Y11U3) - I(V; Y3IU3)]+ for some p(u, U3, V, x) == p(u)p(u3Iu)p(vlu3)p(xlv). The proof of this proposition uses a combination of standard converse techniques from =-=[8]-=-, [9] and [2]. Using Propositions 1 and 2, we can establish the secrecy capacity region for the following special cases. 1) Y1 more capable than Y3 : If Y1 is more capable than Y3 , the capacity regio... |

12 | Multilevel broadcast networks
- Borade, Zheng, et al.
- 2007
(Show Context)
Citation Context ...ed product broadcast channel. For the I-receiver, 2-eavesdropper scenario, we establish inner and outer bounds on the secrecy capacity region for the class of 3-receiver multi-level broadcast channel =-=[6]-=-. We show that the bounds coincide when the receiver is more capable than the non-degraded eavesdropper. II. DEFINITIONS AND PROBLEM SETUP We consider the 3-receiver discrete memoryless broadcast chan... |