IEEE Communications Letters

The Gaussian Diamond-Wiretap Channel With Rate-Limited Relay Cooperation

Si-Hyeon Lee, Ashish J. Khisti

Published Nov 8, 2016• 3 citations

Abstract

In this letter, we establish the secure degrees-of-freedom of the Gaussian diamond-wiretap channel with rate-limited relay cooperation, where the eavesdropper not only observes the relay transmission through another multiple access channel but also wiretaps some of communication links among relays. The legitimate parties do not know the location of wiretapped relay links nor the eavesdropper's channel state information. As an optimal relay cooperation strategy, a noise-forwarding scheme that does not incorporate secure network coding is adopted. Furthermore, we briefly outline how the scheme can be extended to incorporate the case when the source-relay links are also wiretapped.

DOI: 10.1109/lcomm.2016.2626278

Related papers

The Wiretapped Diamond-Relay Channel

Si-Hyeon Lee, Ashish J. Khisti

In this paper, we study a diamond-relay channel where the source is connected toMrelays through orthogonal links and the relays transmit to the destination over a wireless multiple-access channel in the presence of an eavesdropper. The eavesdropper not only observes the relay transmissions through another multiple-access channel but also observes a certain number of source-relay links. The legitimate terminals know neither the eavesdropper's channel state information nor the location of source-relay links revealed to the eavesdropper except the total number of such links. For this wiretapped diamond-relay channel, we establish the optimal secure d.o.f. In the achievability part, our proposed scheme uses the source-relay links to transmit a judiciously constructed combination of message symbols, artificial noise symbols, and fictitious message symbols associated with secure network coding. The relays use a combination of beamforming and interference alignment in their transmission scheme. For the converse part, we take a genie-aided approach assuming that the location of wiretapped links is known.

arXiv:1606.05954IEEE Transactions on Information TheoryAug 21, 20185 citations

The Gaussian Diamond-Wiretap Channel with Conferencing Relays

Si-Hyeon Lee, Ashish J. Khisti

In this letter, we consider the Gaussian diamond-wiretap channel with conferencing links between relays for the following three cases: 1) both conferencing links are confidential; 2) both conferencing links are public; and 3) one conferencing link is confidential, the other link is public, and the legitimate parties do not know which link is confidential or public. For all the cases, we establish the exact secure degrees of freedom (d.o.f.). Our results show that if at least one of conferencing links is confidential, the secure d.o.f. improves upon the case of no conferencing. In these cases of fully and partially confidential conferencing, it is shown to be sufficient to use the conferencing links only for transmitting noise symbols. On the other hand, if conferencing information is fully revealed to the eavesdropper, it is shown that there is no gain in secure d.o.f. due to conferencing, even if the conferencing information is also known to the legitimate destination.

IEEE Communications LettersJan 1, 20163 citations

Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel

Si-Hyeon Lee, Wanyao Zhao, Ashish J. Khisti

In this paper, we consider the Gaussian diamond-wiretap channel that consists of an orthogonal broadcast channel from a source to two relays and a Gaussian fast-fading multiple access-wiretap channel from the two relays to a legitimate destination and an eavesdropper. For the multiple access part, we consider both the case with full channel state information (CSI) and the case with no eavesdropper's CSI, at the relays and the legitimate destination. For both the cases, we establish the exact secure degrees of freedom and generalize the results for multiple relays. For the converse part, we introduce a new technique of capturing the trade-off between the message rate and the amount of individual randomness injected at each relay. In the achievability part, we show (i) how to strike a balance between sending message symbols and common noise symbols from the source to the relays in the broadcast component and (ii) how to combine artificial noise-beamforming and noise-alignment techniques at the relays in the multiple access component.

arXiv:1512.06291IEEE International Symposium on Information Theory (ISIT)Jul 1, 201613 citations

Interaction and Secrecy in Gaussian Diamond Relay Networks

Wanyao Zhao

In this thesis, the physical layer secrecy for several Gaussian network models are studied. We first establish the secure degrees of freedom (d.o.f.)~of helper-assisted Gaussian wiretap channel with shared keys between the transmitter and the helpers. As a natural extension, we next consider the Gaussian diamond wiretap channel where the relays can obtain common randomness from the source node. Secure d.o.f.~for the diamond wiretap channel is established and upper and lower bounds for the multi-relay case are also provided. We then study the diamond channel with conferencing links and investigate the effects of the conferencing links under Gaussian channel as well as binary adder MAC channel. Finally we discuss the artificial noise transmission for secrecy with constant-amplitude constraint for the beamforming vector. The effects of such constraint are examined and algorithms to solve for the beamforming vector are given.

Nov 1, 20150 citations

An improved achievable secrecy rate for the relay-eavesdropper channel

Peng Xu, Zhiguo Ding, Xuchu Dai +1 more

This paper study information-theoretic security for a four-node relay-eavesdropper channel. We propose a new achievable scheme whose key idea is to combine noisy network coding for relay channels and the interference assisted strategy for wiretap channel with a helping interferer. The corresponding achievable secrecy rate is characterized for both discrete memoryless and Gaussian channels. The previous interference assisted schemes such as noise-forwarding and cooperative jamming are shown to be special cases of the proposed scheme. Moreover, in some very strong eavesdropping case where these interference assisted schemes can only achieve zero secrecy rate, the proposed secrecy scheme can still achieve a positive secrecy rate.

IEEE Wireless Communications and Networking ConferenceApr 1, 20132 citations

Degraded Gaussian Diamond–Wiretap Channel

Si-Hyeon Lee, Ashish J. Khisti

We establish upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel, and identify several ranges of channel parameters where these bounds coincide with useful intuitions. Furthermore, we investigate the effect of the presence of an eavesdropper on the capacity. We consider the following two scenarios: 1) common randomness is available at the source and the two relays and 2) randomness is available only at the source, and there is no randomness at the relays. Our upper bounds are established by taking into account the correlation between the two relay signals and the available randomness at the encoders, which generalize the techniques recently developed for the case without secrecy constraint. For the lower bounds, we propose two types of coding schemes: 1) decode-and-forward schemes where the relays cooperatively transmit the message and the fictitious message and 2) partial decode-and-forward schemes incorporated with multicoding in which each relay sends an independent partial message and the whole or partial fictitious message using dependent codewords.

IEEE Transactions on CommunicationsOct 26, 20158 citations