The Relay Channel with a Wire-tapper

Yüksel, Melda; Erkip, Elza

doi:10.1109/ciss.2007.4298265

Cited by 64 publications

(50 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If we disable the confidential messages sent to user 1 by setting , the channel model reduces to a relay channel with secrecy constraints, and the achievable equivocation rate for the second user becomes (15) subject to (16) and the corresponding joint distribution reduces to . Further, if we make the potentially suboptimal selection of , the corresponding achievable secrecy rate and the constraint coincide with their counterparts found in [11], [13] for the relay channel.…”

Section: Remarkmentioning

confidence: 99%

“…[8], [9] consider broadcast channels (BCs) where both receivers want to have secure communication with the transmitter; in here as well, each receiver of the BC is an eavesdropper for the other user. [10]- [16] consider secrecy in relay channels, where in [10]- [13], the relay is the eavesdropper, while in [14], [15] there is an external eavesdropper. In [16], the relay helps the transmitter to improve its rate while it receives confidential messages that should be kept hidden from the main receiver.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secrecy in cooperative relay broadcast channels

Ekrem

Ulukuş

2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.Index Terms-Cooperation, cooperative relay broadcast channel, information theoretic security, secrecy.

show abstract

Section: Remarkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Secrecy in cooperative relay broadcast channels

Ekrem

Ulukuş

2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…7.6) which was considered in [26] and [30]. In the relay-eavesdropper channel, the relay node will use DAF and CAF methods to strengthen the main link.…”

Section: Active Cooperation For Secrecymentioning

confidence: 99%

Cooperative Secrecy in Wireless Communications

Ulukuş

Ekrem

2009

Securing Wireless Communications at the Physical Layer

View full text Add to dashboard Cite

The broadcast nature of wireless communications leads to two concepts: cooperation and secrecy. The basis for both cooperation and the potential lack of secrecy is the over-heard information at the unintended parties, which wireless communication channel provides for free. It is well-established that users can help increase each others' rates by intelligently using their over-heard information. It is also well-accepted that the leakage of information through the over-heard signals may cause loss of confidentiality and secrecy. Cooperation and secrecy have been studied individually over the past three decades following the seminal papers of van der Meulen [1] who introduced the relay channel, which is the simplest model for cooperative communications and Wyner [2] who introduced the wire-tap channel, which is the simplest model to study secrecy in communications. It is interesting to note that, both of these are simple three-node networks, where in the former, the sole purpose of the third node (relay) is to increase the achievable rate of the single-user channel between the transmitter and the receiver by transmitting signals based on its over-heard information, while in the latter, the third node (eavesdropper) is a passive entity which uses its over-heard information to extract as much information as possible about the messages transmitted in the single-user communication channel between the transmitter and the receiver. In this chapter, we will summarize the mostly separate literatures on cooperation and secrecy.More recently, there has been a tremendous amount of interest and some initial work on the interactions of cooperation and secrecy. The recent literature on the S. Ulukus ( )

show abstract

“…The secrecy sum capacity for a reverse broadcast channel is derived subject to this restrictive assumption. The notion of the wire-tap channel is also extended to multiple access channels [13]- [16], relay channels [17]- [20], parallel channels [21] and MIMO channels [22]- [27]. Some other related works on the communication of confidential messages can be found in [28]- [32].…”

Section: Introductionmentioning

confidence: 99%

Secure broadcasting : The secrecy rate region

Bagherikaram

Motahari

Khandani

2008

2008 46th Annual Allerton Conference on Communication, Control, and Computing

View full text Add to dashboard Cite

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where individual secure messages are broadcast over open media and can be received by any illegitimate receiver. The secrecy level is measured by the equivocation rate at the eavesdropper. We first study the general (non-degraded) broadcast channel with confidential messages. We present an inner bound on the secrecy capacity region for this model. The inner bound coding scheme is based on a combination of random binning, and the Gelfand-Pinsker bining. This scheme matches Marton's inner bound on the broadcast channel without confidentiality constraint. We further study the situation in which the channels are degraded. For the degraded broadcast channel with confidential messages, we present the secrecy capacity region. Our achievable coding scheme is based on Cover's superposition scheme and random binning. We refer to this scheme as Secret Superposition Scheme. In this scheme, we show that randomization in the first layer increases the secrecy rate of the second layer. This capacity region matches the capacity region of the degraded broadcast channel without security constraint. It also matches the secrecy capacity for the conventional wire-tap channel. Our converse proof is based on a combination of the converse proof of the conventional degraded broadcast channel and Csiszar Lemma. We then assume that the channels are Additive White Gaussian Noise (AWGN) and show that secret superposition scheme with Gaussian codebook is optimal. The converse proof is based on the generalized entropy power inequality. Finally, we use a broadcast strategy for the slowly fading wire-tap channel when only the eavesdropper's channel is fixed and known at the transmitter. We derive the optimum power allocation for the layers which maximizes the total average rate.

show abstract

The Relay Channel with a Wire-tapper

Cited by 64 publications

References 15 publications

Secrecy in cooperative relay broadcast channels

Secrecy in cooperative relay broadcast channels

Cooperative Secrecy in Wireless Communications

Secure broadcasting : The secrecy rate region

Contact Info

Product

Resources

About