Degraded Gaussian Diamond–Wiretap Channel

Lee, Si-Hyeon; Khisti, Ashish

doi:10.1109/tcomm.2015.2493063

Cited by 6 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the presence of a secrecy constraint, such converse proof techniques need to be adopted carefully by taking into account the stochastic encoding functions introduced to confuse the eavesdropper. Those works [25], [26] were generalized in [28] for the degraded Gaussian diamond-wiretap channel, in which the secrecy capacity was characterized for several ranges of channel parameters. For non-degraded case, however, the coding scheme used in [28] achieves zero secure d.o.f.…”

Section: Introductionmentioning

confidence: 99%

“…Those works [25], [26] were generalized in [28] for the degraded Gaussian diamond-wiretap channel, in which the secrecy capacity was characterized for several ranges of channel parameters. For non-degraded case, however, the coding scheme used in [28] achieves zero secure d.o.f. and structured codes such as interference alignment and beamforming schemes need to be involved to achieve a positive secure d.o.f.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secure degrees of freedom of the Gaussian diamond-wiretap channel

Lee

Zhao

Khisti

2016

2016 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

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. In the case with full CSI, we propose a scheme where the relays simultaneously beamform common noise signals in the null space of the legitimate destination's channel, and align them with the message signals at the eavesdropper. In the case with no eavesdropper's CSI, we present a scheme that efficiently utilizes the broadcast links by incorporating computation between the message and common noise symbols at the source. Finally, most of our achievability and converse techniques can also be adapted to the Gaussian (non-fading) channel model.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Secure degrees of freedom of the Gaussian diamond-wiretap channel

Lee

Zhao

Khisti

2016

2016 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…We require that a message be transmitted reliably to the legitimate receiver, while keeping it confidential from the eavesdropper. We adopt the informationtheoretic notion of confidentiality, widely used in the literature on the wiretap channel [6]- [23]. We thus refer to our setup as the wiretapped diamond-relay channel.…”

mentioning

confidence: 99%

The Wiretapped Diamond-Relay Channel

Lee

Khisti

2018

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

In this paper, we study a diamond-relay channel where the source is connected to M relays 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 degrees of freedom. In the achievability part, our proposed scheme uses the source-relay links to transmit a judiciously constructed combination of message symbols, artificial noise symbols as well as 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. I. INTRODUCTIONCloud Radio-Access Network (C-RAN) is a promising architecture to meet the demand for higher data rates in next generation wireless networks. In these systems, the base-stations act as relays and are connected via high-speed backhaul links to a cloud network. Encoding and decoding operations happen centrally in the cloud. The study of fundamental information theoretic limits and optimal coding techniques for such systems is a fertile area of research.Motivated by C-RAN, we study a model where the source is connected to M relay terminals using orthogonal links with a fixed capacity. The relays transmit to the destination over a wireless multipleaccess channel. Such a setup is known as the diamond-relay network [1]- [5]. We study this model in the presence of an eavesdropper who can eavesdrop the orthogonal links from the source to the relays as DRAFT a way that only a single source-relay link is active in each sub-scheme. April 8, 2018 DRAFT 5 Note that for N = 1, ds = min α, M −1 M can be shown to be achievable by time-sharing between (α, ds) = (0, 0) and (α, ds) = ( M −1 M , M −1 M ). For N ≥ 2, ds = min N α, Nα+M −1 M +1

show abstract

On the Private Key Capacity of the <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Relay Pairwise Independent Network

Ding

Dai

et al. 2016

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Degraded Gaussian Diamond–Wiretap Channel

Cited by 6 publications

References 27 publications

Secure degrees of freedom of the Gaussian diamond-wiretap channel

Secure degrees of freedom of the Gaussian diamond-wiretap channel

The Wiretapped Diamond-Relay Channel

On the Private Key Capacity of the <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Relay Pairwise Independent Network

Contact Info

Product

Resources

About