Asilomar Conference on Signals, Systems and Computers (ACSSC)

On secure communication over a class of degraded relay networks

Amir Salimi, Jörg Kliewer

Published Nov 1, 2010• 1 citation

Abstract

In this paper we consider a class of degraded relay networks with multiple receivers, address the capacity region for the multicast case, and consider information-theoretic security aspects. Exemplary, we study a degraded relay network, which is comprised of one source, an arbitrary number of relay nodes, and two receiver nodes in a degraded setting. Based on a simple combination of superposition encoding and decode-and-forward at the relay nodes we provide an achievable rate region for this network. We then consider a related setup where the weaker receiver node now plays the role of an eavesdropper who is able to listen to the transmission of the source and all relays in the network. Based on the result for the degraded relay network case we then provide an achievable secrecy rate for this setup.

DOI: 10.1109/acssc.2010.5757559

Related papers

On cooperative secrecy for discrete memoryless relay networks

Etienne Perron, Suhas N. Diggavi, Emre Telatar

In this paper we consider information-theoretically secure communication between two special nodes (“source” and “destination”) in a memoryless network with authenticated relays, where the secrecy is with respect to a class of eavesdroppers. We develop achievable secrecy rates when authenticated relays also help increase secrecy rate by inserting noise into the network.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 201010 citations

Information secrecy from multiple eavesdroppers in orthogonal relay channels

Vaneet Aggarwal, Lalitha Sankar, A.R. Calderbank +1 more

The secrecy capacity of relay channels with orthogonal components is studied in the presence of additional passive eavesdropper nodes. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper(s) can overhear either one or both of the orthogonal channels. For a single eavesdropper node, the secrecy capacity is shown to be achieved by apartial decode-and-forward(PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. For the case of two eavesdropper nodes, secrecy capacity is shown to be achieved by PDF for a sub-class of channels.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20096 citations

Multi-Terminal Two-Hop Untrusted-Relay Networks With Hierarchical Security Guarantees

Ahmed A. Zewail, Aylin Yener

We consider a two-source two-destination two-hop relay network, where all data communication must be kept secret from the relay node. The model considered is the simplest primitive that embodies a multi-transmitter multi-receiver network that needs to communicate sharing an untrusted relay node. We focus on two scenarios. In the first scenario, each source aims to send two messages to be kept secret from the relay: a common message that should be decoded by both destinations, and a private message that should be decoded by the first destination while kept secret from the second one. We define an achievable rate region by utilizing stochastic encoding at the sources, the Gaussian noise cooperative jamming from the destinations, and compress-and-forward at the relay. In the second scenario, each source aims to send a confidential message to its intended destination, which should be kept secret from the other one as well as the relay. We define an achievable rate region using a combination of nested lattice codes and random binning at the sources, structured cooperative jamming from destinations, and scaled compute-and-forward at the relay. We also derive genie-aided outer bounds on the secrecy rate regions. We present numerical results that demonstrate the performance of the proposed achievable schemes. Overall, this paper provides insights into how to utilize an untrusted relay to communicate to destinations with different levels of security clearance, and how intentional interference is an enabler of communication.

IEEE Transactions on Information Forensics and SecurityApr 18, 201711 citations

Secrecy in broadcast channels with receiver side information

Rafael F. Wyrembelski, Aydin Sezgin, Holger Boche

We study secret communication for broadcast channels with two legitimate receivers and one eavesdropper. The transmitter sends two independent confidential messages to the legitimate receivers which have to be kept secret from the eavesdropper. Here, each legitimate receiver is interested in one confidential message having the other one already as side information available. This problem arises for example in the broadcast phase in a bidirectional relay network, where a relay node establishes a bidirectional communication between two nodes while keeping the communication secure from an eavesdropper outside the network. We provide achievable rate regions and an outer bound on the secrecy capacity region.

Asilomar Conference on Signals, Systems and Computers (ACSSC)Nov 1, 201117 citations

Combined relay selection and secure beamforming for decode-and-forward networks with multiple eavesdroppers

Zhongjian Liu, Xiaoning Zhang, Chen Chen +1 more

In this paper, we investigate a two-stage cooperative network consisting of one source, one corresponding destination, multiple eavesdroppers, and several intermediate nodes. In the first stage, the source selects several relays from the intermediate nodes and broadcasts its message to them. In the second stage, the selected nodes operating as the decode-and-forward (DF) relays perform collaborative beamforming for the secure data transmission that prevents eavesdropping. We study the relay selection and secure beamforming problem considering both the achievable rate in the first stage and the secrecy rate constraint in the second stage, whereas the existing works leave out of the transmission in the first stage. We propose two combined relay selection and beamforming schemes. The first scheme is to maximize the secrecy rate of the relay selection and beamforming with the achievable rate constraint in the first stage. To reduce the complexity of the first scheme, the second scheme combines relay selection and a suboptimal secure beamforming scheme, in which we hypothesize a virtual eavesdropper instead of all eavesdroppers and maximize the secrecy rate according to the virtual eavesdropper. Simulation results show that the performance of our first scheme is the same as that of the exhaustive search scheme, and the second scheme significantly reduces the complexity with acceptable performance degradation.

International Conference on Wireless Communications and Signal Processing (WCSP)Oct 1, 20135 citations

Secure communication in multiple relay networks through decode-and-forward strategies

Raef Bassily, Şennur Ulukuş

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decode-and-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

Journal of Communications and NetworksAug 1, 201232 citations