#### DMCA

## 1 Secure Broadcasting

### Citations

12157 |
Elements of information theory
- Cover, Thomas
- 2006
(Show Context)
Citation Context ...er of columns. The codewords for message wk in Cj are labeled as u n j1(wk), . . . u n jQ (wk) . j In what follows, whenever typicality is mentioned it is intended to be ε−weak typicality (see, e.g., =-=[19]-=-). The set T(Uj) denotes the set of all sequences that are typical with respect to distribution p(Uj) and the set T(Xj, Uj) denotes the set of all jointly typical sequences (xn j , unj ) with respect ... |

3463 | New directions in cryptography
- DIFFIE, HELLMAN
- 1976
(Show Context)
Citation Context ... that only users who have access to the decryption key could view it. Indeed, in the absence of such a mechanism, current solutions rely on variants of traditional public key cryptography (see, e.g., =-=[1]-=-) and are vulnerable to attacks such as piracy [2]. An information theoretic framework for perfect secrecy was developed by Shannon [3], and the problem of broadcasting confidential messages was origi... |

2070 |
Information Theory and Reliable Communication
- Gallager
- 1968
(Show Context)
Citation Context ...iables ˆ Zkj ∼ N(0, σ 2 π(k+1)j − σ 2 π(k)j) are independent. Since I(Xj; ˆ Yij| ˆ Yej) is a continuous and concave function in p(X) (see Fact 2), we use discretization arguments (see, e.g., Ch. 7 in =-=[20]-=-) to extend Theorem 1 to the Gaussian case C common K,M (P) = max Q M j=1 p(Xj), E[ P M j=1 X2 j ]≤P min i∈{1,2,...,K} M∑ I(Xj; ˆ Yij| ˆ Yej) . (31) Now observe that max p(Xj),E[X 2 j ]≤Pj I(Xj; ˆ Yij... |

1468 | Fundamentals of Wireless Communication - Tse, Viswanath - 2005 |

1189 |
Communication theory of secrecy systems
- Shannon
- 1949
(Show Context)
Citation Context ...y on variants of traditional public key cryptography (see, e.g., [1]) and are vulnerable to attacks such as piracy [2]. An information theoretic framework for perfect secrecy was developed by Shannon =-=[3]-=-, and the problem of broadcasting confidential messages was originally formulated by Wyner [4]. Wyner considered a special broadcast channel (also known as the wiretap channel): one sender, an intende... |

797 | R.Laroia, “Opportunistic Beamforming using Dumb Antennas - Viswanath - 2002 |

740 |
Broadcast Channels with Confidential Messages
- Csiszar, Korner
- 1978
(Show Context)
Citation Context ...r and the equivocation at the eavesdropper when the eavesdropper has a degraded channel compared to the intended receiver. This formulation has been generalized for non-degraded broadcast channels in =-=[5]-=-, and applied to Gaussian channels in [6]. While the results for wire-tap channels are rather surprising in that they show that it is possible to achieve a positive rate while keeping the eavesdropper... |

651 |
Order Statistics
- David, Nagaraja
- 2003
(Show Context)
Citation Context ...ate (88) ∫ ∞ R ≤ log(1 + γ ¯ Pγ) − E[log(1 + min(γ, µ) ¯ Pγ)]pγdγ 0 = E[log(1 + γ ¯ Pγ) − log(1 + min(γ, µ) ¯ Pγ)], and this completes the proof of the upper bound.First note the following. Fact 3 ( =-=[24]-=-): Let V1, V2, . . ., VK, VK+1 be i.i.d. exponential random variables with mean λ and Vmax(K + 1) denotes the largest of these exponential and Vmax(K) the second largest. The joint distribution of (Vm... |

575 | Capacity of fading channels with channel side information
- Goldsmith, Varaiya
- 1997
(Show Context)
Citation Context ...we need to resolve the technicality in that the fading channel has continuous valued fading coefficients, while the rate expression in (44) is only for a finite number of parallel channels. Following =-=[22]-=-, our approach is to discretize the continuous valued coefficients and thus create parallel channels, one for each quantized state. The number of parallel channels increases as the quantization become... |

359 |
The Gaussian wiretap channel
- Leung-Yan-Cheong, Hellman
- 1978
(Show Context)
Citation Context ...r when the eavesdropper has a degraded channel compared to the intended receiver. This formulation has been generalized for non-degraded broadcast channels in [5], and applied to Gaussian channels in =-=[6]-=-. While the results for wire-tap channels are rather surprising in that they show that it is possible to achieve a positive rate while keeping the eavesdropper in near-perfect equivocation, they also ... |

321 | Broadcast encryption
- Fiat, Naor
- 1994
(Show Context)
Citation Context ... key could view it. Indeed, in the absence of such a mechanism, current solutions rely on variants of traditional public key cryptography (see, e.g., [1]) and are vulnerable to attacks such as piracy =-=[2]-=-. An information theoretic framework for perfect secrecy was developed by Shannon [3], and the problem of broadcasting confidential messages was originally formulated by Wyner [4]. Wyner considered a ... |

301 |
The wire-tap channel,” Bell Syst
- Wyner
- 1975
(Show Context)
Citation Context ...tacks such as piracy [2]. An information theoretic framework for perfect secrecy was developed by Shannon [3], and the problem of broadcasting confidential messages was originally formulated by Wyner =-=[4]-=-. Wyner considered a special broadcast channel (also known as the wiretap channel): one sender, an intended receiver, and one eavesdropper. He characterized the tradeoff between the rate to the intend... |

200 | On the Secrecy Capacity of Fading Channels
- Gopala, Lai, et al.
- 2008
(Show Context)
Citation Context ...ecently, the case of discrete memoryless parallel channels with one receiver and one eavesdropper has been studied in [10], [11]. The wiretap setting has been also studied for fading channels in [12]–=-=[14]-=-. All these works consider the setup of one sender, one receiver, and one eavesdropper. There is also a vast literature on multiuser diversity in broadcast channels with independent messages starting ... |

198 | Optimal power allocation over parallel gaussian broadcast channels - Tse - 1997 |

185 | Secure Communication over Fading Channels
- Liang, Poor, et al.
- 2008
(Show Context)
Citation Context ...rks, the Gaussian wiretap channel was extended to parallel channels in [9]. More recently, the case of discrete memoryless parallel channels with one receiver and one eavesdropper has been studied in =-=[10]-=-, [11]. The wiretap setting has been also studied for fading channels in [12]–[14]. All these works consider the setup of one sender, one receiver, and one eavesdropper. There is also a vast literatur... |

110 | Secrecy capacity of wireless channels - Barros, Rodrigues - 2006 |

86 | Secret Communication using artificial noise
- Negi, Goel
- 2005
(Show Context)
Citation Context ...ore recently, the case of discrete memoryless parallel channels with one receiver and one eavesdropper has been studied in [10], [11]. The wiretap setting has been also studied for fading channels in =-=[12]-=-–[14]. All these works consider the setup of one sender, one receiver, and one eavesdropper. There is also a vast literature on multiuser diversity in broadcast channels with independent messages star... |

59 |
Secrecy capacity of independent parallel channels
- Li, Yates, et al.
- 2006
(Show Context)
Citation Context ...he Gaussian wiretap channel was extended to parallel channels in [9]. More recently, the case of discrete memoryless parallel channels with one receiver and one eavesdropper has been studied in [10], =-=[11]-=-. The wiretap setting has been also studied for fading channels in [12]–[14]. All these works consider the setup of one sender, one receiver, and one eavesdropper. There is also a vast literature on m... |

28 |
On a special class of broadcast channels with confidential messages
- Dijk
- 1997
(Show Context)
Citation Context ...n the upper bound derivation but, also, in other subsequent proofs. Fact 2: For any random variables X, Y , and Z the quantity I(X; Y |Z) is concave in p(X). The proof is implicit in the arguments in =-=[18]-=-. We provide it in Appendix I for completeness. Suppose there exists a sequence of (n, 2 nR ) codes such that, for every ε > 0, as n → ∞ Pr(W = ˆ Wi) ≤ ε, i = 1, 2, . . .K 1 n I(W; Y n e1, . . .,Y n ... |

22 | A coding theorem for secret sharing communication systems with two Gaussian wiretap channels
- Yamamoto
- 1991
(Show Context)
Citation Context ...d as the wiretap analog of the multiuser diversity results in settings without secrecy constraint (see, e.g., [8]). In related works, the Gaussian wiretap channel was extended to parallel channels in =-=[9]-=-. More recently, the case of discrete memoryless parallel channels with one receiver and one eavesdropper has been studied in [10], [11]. The wiretap setting has been also studied for fading channels ... |

21 |
El Gamal. Capacity of the product and sum of two unmatched broadcast channels
- A
- 1980
(Show Context)
Citation Context ...it to the strongest user on each parallel channel and use independent codebooks across the channels. Our results for the parallel broadcast channels can be viewed as generalizations of the results in =-=[7]-=- which considers a similar setup without the presence of an eavesdropper. Our study on parallel channels provides insights to the problem of broadcasting confidential messages over fading channels. In... |

16 |
Optimal power allocation for parallel broadcast channels with independent and common information
- Jindal, Goldsmith
- 2004
(Show Context)
Citation Context ...stems. As discussed before, the case of a common message has received much less attention in the literature. The problem of transmitting a common message on parallel channels has been studied in [7], =-=[17]-=- but we are not aware of a general treatment of this problem for fading channels (without an eavesdropper). We hope that the secrecy constraint creates renewed interest in the study of common message ... |

10 | Secure broadcasting with multiuser diversity,” presented at
- Khisti, Tchamkerten, et al.
- 2006
(Show Context)
Citation Context ...-F. V. FADING CHANNELS The second part of this paper considers wireless fading channels. The case of one receiver and one eavesdropper has been recently studied in a number of recent works [10]–[14], =-=[21]-=-. The proposed schemes adapt the transmission power and/or rate depending on the instantaneous channel conditions. The time varying nature of the fading channel enables secure transmission even when t... |