#### DMCA

## Discrete memoryless interference and broadcast channels with confidential messages: secrecy rate regions (2008)

### Cached

### Download Links

Venue: | IEEE Transactions on Information Theory |

Citations: | 159 - 12 self |

### Citations

12168 |
Elements of information theory
- Cover, Thomas
- 1991
(Show Context)
Citation Context ...ing conventions and X = [X1, . . .,Xn], X˜ i = [Xi, . . . , Xn]. X i = [X1, . . .,Xi], Finally, we use A (n) ǫ (PX) to denote the set of (weakly) jointly typical sequences x with respect to P(x) (see =-=[5]-=- for more details). B. The Interference Channel with Confidential Messages Consider a discrete memoryless interference channel with finite input alphabets X1, X2, finite output alphabets Y1, Y2, and t... |

1247 |
Noiseless coding of correlated information sources
- Slepian, Wolf
- 1973
(Show Context)
Citation Context ...tisfied. Following the same approach, we can prove that (11) is satisfied. V. INNER BOUND FOR THE BROADCAST CHANNEL WITH CONFIDENTIAL MESSAGES We now prove Theorem 3 based on the Slepian-Wolf binning =-=[22]-=- and double binning. In this section we redefine the parameters R1, R2, R ′ 1 , R′ 2 , Q1, Q2, M1, and M2. The coding structure for the BC-CM is shown in Fig. 4. We employ a joint encoder to generate ... |

740 |
Broadcast Channels with Confidential Messages
- Csiszar, Korner
- 1978
(Show Context)
Citation Context ... the receiver, Wyner determined the capacity-secrecy tradeoff. This result was generalized by Csiszár and Körner who determined the capacity region of the broadcast channel with confidential messages =-=[2]-=- in which a message intended for one of the receivers is confidential. In this paper, we study inner and outer bounds for achievable secrecy regions of both the broadcast and the interference channel ... |

559 |
The wire-tap channel
- Wyner
- 1975
(Show Context)
Citation Context ...b.rutgers.edu). I. Marić is with Department of Electrical Engineering, Stanford University, Stanford, CA 94305 (email: ivanam@wsl.stanford.edu). by equivocation. This approach was introduced by Wyner =-=[1]-=- for the wiretap channel, a scenario in which a single source-destination communication is eavesdropped. Under the assumption that the channel to the wire-tapper is a degraded version of that to the r... |

473 |
A new achievable rate region for the interference channel
- Han, Kobayashi
- 1981
(Show Context)
Citation Context ...ect security for confidential messages, no partial decoding of the other transmitter’s message is allowed at a receiver. It precludes rate-splitting schemes used by Carleial [3] and Han and Kobayashi =-=[4]-=- for the classical interference channel. Finally, we investigate the inner bound for the BCCM based on the Slepian-Wolf binning technique [5]. We notice that no common message in the sense of Marton [... |

429 | Secret Key Agreement by Public Discussion from Common Information - Maurer - 1993 |

359 |
The Gaussian wiretap channel
- Leung-Yan-Cheong, Hellman
- 1978
(Show Context)
Citation Context ...confidential message Wt in slot t with time fraction ρt, t = 1, 2. We refer to this technique as the time-sharing scheme. We note that, in each slot, the channel reduces to a Gaussian wiretap channel =-=[26]-=-. Let R [T] GIC denote the set of (R1, R2) satisfying 0 ≤ R1 ≤ ρ1 [ ( log 1 + 2 P1 ) ( − log 1 + α ρ1 2 )] P1 2 ρ1 0 ≤ R2 ≤ ρ2 [ ) ( log − log 1 + α 2 2 )] P2 1 ( 1 + P2 ρ2 over all time fractions (ρ1... |

320 |
Coding for channel with random parameters
- Gel’fand, Pinsker
- 1980
(Show Context)
Citation Context ...broadcast channel, we can employ joint encoding at the transmitter. Hence, the achievable coding scheme for the BC-CM is based on the double-binning scheme which combines the Gel’fand-Pinsker binning =-=[23]-=- and the random binning. To preserve confidentiality, the achievability bounds on R1 and R2 each include the penalty term I(V1; V2|U). Without the confidentiality constraint, Marton’s inner bound [19]... |

233 |
A coding theorem for the discrete memoryless broadcast channel
- Marton
- 1979
(Show Context)
Citation Context ...tly encodes both messages. We also derive achievable rate regions for the two channel models. Here, we only consider sending confidential messages and, hence, no common message in the sense of Marton =-=[19]-=- is conveyed to the receivers in the case of the broadcast channel. The inner bounds are achieved using random binning techniques. For the broadcast channel, a double-binning coding scheme which allow... |

200 | On the Secrecy Capacity of Fading Channels - Gopala, Lai, et al. - 2008 |

185 | Secure Communication over Fading Channels - Liang, Poor, et al. - 2008 |

151 | The relay-eavesdropper channel: Cooperation for secrecy
- Lai, Gamal
(Show Context)
Citation Context ... in [6]–[10]. The relay channel with confidential messages where the relay node acts as both a helper and a wiretapper has been considered in [11]. The relay-eavesdropper channel has been proposed in =-=[12]-=-. More recently, the cognitive interference channel with confidential messages has been addressed in [13]. The effects of fading on secure wireless communication have been studied in [14]– [18]. In th... |

125 | Information-Theoretic key agreement: From weak to strong secrecy for free,” ser
- Maurer, Wolf
- 2000
(Show Context)
Citation Context ...security constraints Mt ≥ 2 nRt for t = 1, 2 (3) P (n) e ≤ ǫ0 (4) nR1 − H(W1|Y2) ≤ nǫ0 nR2 − H(W2|Y1) ≤ nǫ0 (5a) (5b) are satisfied. This definition corresponds to the so-called weak secrecy-key rate =-=[22]-=-. A stronger measurement of the secrecy level has been defined by Maurer and Wolf in terms of the absolute equivocation [22], where the authors have shown that the former definition could be replaced ... |

123 |
Carleial, “Interference channels
- B
- 1978
(Show Context)
Citation Context ...s. Since we require a perfect security for confidential messages, no partial decoding of the other transmitter’s message is allowed at a receiver. It precludes rate-splitting schemes used by Carleial =-=[3]-=- and Han and Kobayashi [4] for the classical interference channel. Finally, we investigate the inner bound for the BCCM based on the Slepian-Wolf binning technique [5]. We notice that no common messag... |

110 | Secrecy capacity of wireless channels
- Barros, Rodrigues
- 2006
(Show Context)
Citation Context ... proposed in [12]. More recently, the cognitive interference channel with confidential messages has been addressed in [13]. The effects of fading on secure wireless communication have been studied in =-=[14]-=-– [18]. In this paper, we study two distinct but related in multi-terminal secure communication problems following the information-theoretic approach. We focus on discrete memoryless interference and ... |

109 | The Gaussian multiple access wire-tap channel - Tekin, Yener |

109 |
A coding theorem for multiple access channels with correlated sources
- Slepian, Wolf
- 1973
(Show Context)
Citation Context ...ntial messages and, thus, no common message in the sense of Marton [21] is conveyed to the receivers in the broadcast channel model. The derived inner bounds are achieved by random binning techniques =-=[20]-=-. In particular, for the broadcast channel, we introduce a double-binning coding scheme which enables both joint encoding and preserving confidentiality. Next, we consider the switch channel model whi... |

90 | Multiple access channels with confidential messages
- Liang, Poor
- 2008
(Show Context)
Citation Context ...and Csiszár and Körner [2], the more recent information-theoretic research on secure communication focuses at implementing security on the physical layer. Based on independent efforts, the authors of =-=[3]-=- and [4] described achievable secure rate regions and outer bounds for a two-user discrete memoryless multiple access channel with confidential messages. This model generalizes the multiple access cha... |

90 | Common randomness and secret key generation with a helper
- Csiszár, Narayan
- 2000
(Show Context)
Citation Context ...name secret key agreement based on correlated randomness and privacy amplification by public discussion [12–14]. More recently, Csiszár and Narayan have considered secret key generation with a helper =-=[4]-=- and secrecy capacity with public discussion [5] in multi-terminal networks. Another important line of recent work on physical layer security is concerned with communicating confidential information o... |

86 |
Capacity results for the discrete memoryless network
- Kramer
- 2003
(Show Context)
Citation Context ...1|Y2) ≥ H(W1,Y2|V2,U) − H(Y2|V2,U) = H(W1,V1,Y2|V2,U) − H(V1|Y2,V2,U, W1) − H(Y2|V2,U) = H(W1,V1|V2,U) − H(V1|Y2,V2,U, W1) − H(Y2|V2,U) + H(Y2|V1,V2,U, W1). (52) Based on functional dependence graphs =-=[27]-=- and the random code construction, we can show that the following is a Markov chain which yields W1 → (V1,V2,U) → Y2 I(W1;Y2|V1,V2,U) = 0. (53)10 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. X, NO. ... |

81 | Relay channels with confidential messages
- Oohama
(Show Context)
Citation Context ...dition, the Gaussian MAC wiretap channel has been analyzed in [6]–[10]. The relay channel with confidential messages where the relay node acts as both a helper and a wiretapper has been considered in =-=[11]-=-. The relay-eavesdropper channel has been proposed in [12]. More recently, the cognitive interference channel with confidential messages has been addressed in [13]. The effects of fading on secure wir... |

73 |
der Meulen, “A proof of marton’s coding theorem for the discrete memoryless broadcast channel
- Gamal, van
- 1981
(Show Context)
Citation Context ...1, k1),v2(1, 1, k2) ) /∈ A (n) ǫ (PV1,V2|U), for st = 1, . . .,Jt, kt = 1, . . .,Gt, and t = 1, 2}. The definition of R † in (61) implies that R † > I(V1; V2|U). (63) Hence, following the approach of =-=[28]-=-, we have that P {T } ≤ δ3 (64) where δ3 > 0 and δ3 is small for sufficiently large n. In other words, the encoding is successful with probability close to 1 as long as n is large. In the following, w... |

58 | Unconditionally secure key agreement and the intrinsic conditional information - Maurer, Wolf - 1999 |

47 | The discrete memoryless multiple access channel with confidential messages
- Liu, Maric, et al.
(Show Context)
Citation Context ...zár and Körner [2], the more recent information-theoretic research on secure communication focuses at implementing security on the physical layer. Based on independent efforts, the authors of [3] and =-=[4]-=- described achievable secure rate regions and outer bounds for a two-user discrete memoryless multiple access channel with confidential messages. This model generalizes the multiple access channel (MA... |

29 | Secure nested codes for type ii wiretap channels
- Liu, Liang, et al.
- 2007
(Show Context)
Citation Context ...owever, constructing practical wiretap codes that can achieve the derived rates is a challenging problem. Code constructions for a binary-input Gaussian wiretap channel have recently been proposed in =-=[29]-=-. Similarly, APPENDIX Proof: (Lemma 1) By the definition of ∆1, we have ∆1 = I(V1; Y1|U) − I(V1; Y2|U) = I(V1, V2; Y1|U) − I(V2; Y1|V1, U) − I(V1, V2; Y2|U) + I(V2; Y2|V1, U). (72) ∆2 = I(V2; Y2|U) − ... |

19 | Cognitive interference channels with confidential messages
- Liang, Somekh-Baruch, et al.
(Show Context)
Citation Context ... a wiretapper has been considered in [11]. The relay-eavesdropper channel has been proposed in [12]. More recently, the cognitive interference channel with confidential messages has been addressed in =-=[13]-=-. The effects of fading on secure wireless communication have been studied in [14]– [18]. In this paper, we study two distinct but related in multi-terminal secure communication problems following the... |

18 | Secret communication with a fading eavesdropper channel - Li, Yates, et al. - 2007 |

13 |
Capacities for Multiple Terminals
- “Secrecy
- 2004
(Show Context)
Citation Context ...ndomness and privacy amplification by public discussion [12–14]. More recently, Csiszár and Narayan have considered secret key generation with a helper [4] and secrecy capacity with public discussion =-=[5]-=- in multi-terminal networks. Another important line of recent work on physical layer security is concerned with communicating confidential information over wireless networks. Motivated by wireless com... |

12 | Multiple antenna secure broadcast over wireless networks
- Liu, Poor
(Show Context)
Citation Context ...lt is obtained by applying Theorem 4 and by setting R1 > 0 and R2 > 0. More recently, motivated by this work, the multiple-antenna Gaussian broadcast channel with confidential messages was studied in =-=[24]-=-. It was shown that with multiple antennas at transmitters, strictly positive rates to both receivers can be achieved while ensuring information-theoretic secrecy. C. Switch Channel In this subsection... |

3 | Gaussian multiple access wire-tap channel - “The - 2008 |

2 |
multiple access wire-tap channel: Wireless secrecy and cooperative jamming
- “The
- 2007
(Show Context)
Citation Context ...one of the users) to receive noisy channel outputs and, hence, to eavesdrop the confidential information sent by the other user. In addition, the Gaussian MAC wiretap channel has been analyzed in [6]–=-=[10]-=-. The relay channel with confidential messages where the relay node acts as both a helper and a wiretapper has been considered in [11]. The relay-eavesdropper channel has been proposed in [12]. More r... |

2 |
An Achievable Secrecy Throughput of Hybrid-ARQ Protocols for Block fading Channels
- Tang, Liu, et al.
(Show Context)
Citation Context ...sed in [12]. More recently, the cognitive interference channel with confidential messages has been addressed in [13]. The effects of fading on secure wireless communication have been studied in [14]– =-=[18]-=-. In this paper, we study two distinct but related in multi-terminal secure communication problems following the information-theoretic approach. We focus on discrete memoryless interference and broadc... |

2 | multiple access channels with confidential messages - “Generalized - 2006 |

1 | Multi-terminal communications with confidential messages
- Liu, Maric, et al.
- 2007
(Show Context)
Citation Context ...ges We next consider a Gaussian interference channel (GIC) with confidential messages (GIC-CM) where each node employs a single antenna as shown in Fig. 4. We have proposed this problem originally in =-=[25]-=-. We assume the channel input and output symbols to be from an alphabet of real numbers. Following the standard form GIC [20], the received symbols are Y1 = X1 + α1X2 + N1 Y2 = α2X1 + X2 + N2 (23a) (2... |

1 | key agreement over a non-authenticated channel — part III: Privacy amplification - “Secret - 2003 |