#### DMCA

## Secure broadcasting over fading channels (2008)

Venue: | IEEE Transactions on Information Theory |

Citations: | 66 - 9 self |

### Citations

12166 | Elements of Information Theory - Cover, Thomas - 1991 |

3466 | M.: New directions in cryptography
- Diffie, Hellman
- 1976
(Show Context)
Citation Context ...ls, so that only customers who have access to the decryption key can view it. In the absence of such a mechanism, current solutions rely on variants of traditional public key cryptography (see, e.g., =-=[7]-=-) and are vulnerable to attacks such as piracy [9]. The problem of broadcasting confidential messages in an information-theoretic setting was formulated by Wyner [25]. The so-called wiretap channel mo... |

740 |
Broadcast Channels with Confidential Messages
- Csiszar, Korner
- 1978
(Show Context)
Citation Context ...terized the associated rate-equivocation region when the eavesdropper has a degraded channel compared to the legitimate receiver. This formulation is generalized for nondegraded broadcast channels in =-=[5]-=-, and applied to Gaussian channels in [13]. Recently, the wiretap channel has received renewed interest for secure communication in wireless environments [20], [2], [12], [15], [17], [11]. The approac... |

651 |
Order Statistics
- David, Nagaraja
- 2003
(Show Context)
Citation Context ...nnel coefficients to be i.i.d., and from the following “helper” lemma. Lemma 2: If are i.i.d. unit-mean exponentials, then for we have (92) Proof of Lemma 2: First, we use the following fact. Fact 1 (=-=[6]-=-): Let be i.i.d. exponentially distributed random variables with mean , and letKHISTI et al.: SECURE BROADCASTING OVER FADING CHANNELS 2467 and , respectively, denote the largest and second-largest o... |

575 | Capacity of fading channels with channel side information
- Goldsmith, Varaiya
- 1997
(Show Context)
Citation Context ... to a construction with states, where each state specifies the subset of receivers that are above the threshold . An alternative proof based on discretizing the fading coefficients along the lines of =-=[10]-=- is developed in Appendix B. It is worth remarking that our code construction more generally suggests a concatenated coding approach for this channel, with an outer erasure code and an inner wiretap c... |

429 | Secret Key Agreement by Public Discussion from Common Information
- Maurer
- 1993
(Show Context)
Citation Context ...e receiver(s) and the sender that is used to provide CSI to the transmitter. The availability of this (digital) feedback link is reminiscent of the secret key generation protocols pioneered by Maurer =-=[18]-=-. Indeed, this feedback link can be used in a variety of ways rather than just providing CSI as is assumed here and exploring connections to the key-generation approach of Maurer may be fruitful. Thro... |

359 |
The Gaussian wiretap channel
- Leung-Yan-Cheong, Hellman
- 1978
(Show Context)
Citation Context ...ere (70) follows by substituting (68) and (69), (71) follows from the Markov chain , where (72) follows from the fact that the channel is memoryless. From the capacity of the Gaussian wiretap channel =-=[13]-=-, we have that (74) with equality if is conditionally Gaussian given . Since a Gaussian distribution depends only on its mean and variance and is independent of (cf. (67)), we can write without loss o... |

321 | Broadcast Encryption - Fiat, Naor - 1994 |

200 | On the Secrecy Capacity of Fading Channels
- Gopala, Lai, et al.
- 2008
(Show Context)
Citation Context ...t channels in [5], and applied to Gaussian channels in [13]. Recently, the wiretap channel has received renewed interest for secure communication in wireless environments [20], [2], [12], [15], [17], =-=[11]-=-. The approach in these works is to exploit the channel variations experienced by the receivers to enable secure communication even when the eavesdropper has, on average, a channel stronger than that ... |

186 | Capacity and optimal resource allocation for fading broadcast channels. I. Ergodic capacity
- Li, Goldsmith
- 2001
(Show Context)
Citation Context ...els and Independent Messages The problem of broadcasting independent messages to multiple receivers over ergodic fading channels has been well studied when there is no security constraint; see, e.g., =-=[14]-=-, [23]. For such scenarios, an opportunistic transmission scheme is shown to attain the largest sum-capacity. We establish the following analogous result for secure transmission. Proposition 3: For th... |

185 | Secure Communication over Fading Channels
- Liang, Poor, et al.
- 2008
(Show Context)
Citation Context ...oadcast channels in [5], and applied to Gaussian channels in [13]. Recently, the wiretap channel has received renewed interest for secure communication in wireless environments [20], [2], [12], [15], =-=[17]-=-, [11]. The approach in these works is to exploit the channel variations experienced by the receivers to enable secure communication even when the eavesdropper has, on average, a channel stronger than... |

184 | On the capacity of some channels with channel state information - Caire, Shamai - 1999 |

125 | Information-Theoretic key agreement: From weak to strong secrecy for free,” ser
- Maurer, Wolf
- 2000
(Show Context)
Citation Context ...that this is significantly weaker than both the notion considered by Shannon [21], which requires that the mutual information be zero regardless of the block length, and the notion by Maurer and Wolf =-=[19]-=- which requires that the (unnormalized) mutual information approach zero with the block length. In our concluding remarks, we comment further on such issues. Finally, we restrict our attention to the ... |

110 | Secrecy capacity of wireless channels
- Barros, Rodrigues
- 2006
(Show Context)
Citation Context ...or nondegraded broadcast channels in [5], and applied to Gaussian channels in [13]. Recently, the wiretap channel has received renewed interest for secure communication in wireless environments [20], =-=[2]-=-, [12], [15], [17], [11]. The approach in these works is to exploit the channel variations experienced by the receivers to enable secure communication even when the eavesdropper has, on average, a cha... |

59 |
Secrecy capacity of independent parallel channels
- Li, Yates, et al.
- 2006
(Show Context)
Citation Context ...ded broadcast channels in [5], and applied to Gaussian channels in [13]. Recently, the wiretap channel has received renewed interest for secure communication in wireless environments [20], [2], [12], =-=[15]-=-, [17], [11]. The approach in these works is to exploit the channel variations experienced by the receivers to enable secure communication even when the eavesdropper has, on average, a channel stronge... |

21 |
El Gamal. Capacity of the product and sum of two unmatched broadcast channels
- A
- 1980
(Show Context)
Citation Context ...ving scheme is simple: transmit to the strongest receiver on each parallel channel and use independent codebooks across the subchannels. Our results can be viewed as generalizations of the results in =-=[8]-=-, which considers a similar setup without the presence of an eavesdropper. Interestingly, however, the specializations of our capacity-achieving schemes to the case of no eavesdropper are different fr... |

18 |
Secret communication with a fading eavesdropper channel
- Li, Yates, et al.
- 2007
(Show Context)
Citation Context ... it is not known whether the scheme is capacity achieving. Indeed, even for the special case corresponding to a single legitimate receiver ( ), the fast-fading secrecy capacity is not yet known [12], =-=[16]-=-. D. Fading Channels and Independent Messages The problem of broadcasting independent messages to multiple receivers over ergodic fading channels has been well studied when there is no security constr... |

16 |
Measure Theory and Probability
- Adams, Guillemin
- 1996
(Show Context)
Citation Context ...r the upper bound (17a), it suffices to note that For the lower bound (17b), first recall that Since, as established in Appendix C, (63) satisfies the conditions for the dominated convergence theorem =-=[1]-=-, we obtain (64) (61) (65) (62) where is the Euler-Gamma constant ( ).KHISTI et al.: SECURE BROADCASTING OVER FADING CHANNELS 2465 VIII. FADING CHANNELS AND INDEPENDENT MESSAGES In this section, we e... |

10 | Secure broadcasting with multiuser diversity,” presented at
- Khisti, Tchamkerten, et al.
- 2006
(Show Context)
Citation Context ...ndegraded broadcast channels in [5], and applied to Gaussian channels in [13]. Recently, the wiretap channel has received renewed interest for secure communication in wireless environments [20], [2], =-=[12]-=-, [15], [17], [11]. The approach in these works is to exploit the channel variations experienced by the receivers to enable secure communication even when the eavesdropper has, on average, a channel s... |