Achievable Secrecy Rates for Relay-Eavesdropper Channel Based on the Application of Noisy Network Coding

Peng Xu, Zhiguo Ding, Xuchu Dai

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

In this paper, we consider the design of a new secure transmission scheme for a four-node relay-eavesdropper channel, where user cooperation is used to facilitate secure communications. The key idea of the proposed achievable scheme is to apply the compression relaying concept of noisy network coding (NNC) to the secrecy communication scenario. But different from the original non-secrecy NNC, the compression rate at the relay is adaptively chosen according to the eavesdropping channel. Particularly, helping interference information is injected into the compression codebook at the relay by simply enlarging the compression rate, which is to effectively suppress the eavesdropping channel. Closed-form expressions of the secrecy rates achieved by the proposed NNC-based secure scheme are characterized for both the discrete memoryless and Gaussian relay-eavesdropper channels, where the optimal compression rate and the optimal transmit power at the relay are also determined. The proposed secure scheme can be viewed as a general framework, which naturally combines the NNC compression relaying scheme with the interference-assisted scheme. Analytical and numerical results demonstrate that the proposed secure scheme offers constant performance gains over typical existing cooperative secure schemes.

Original languageBritish English
Pages (from-to)1736-1751
Number of pages16
JournalIEEE Transactions on Information Forensics and Security
Volume13
Issue number7
DOIs
StatePublished - Jul 2018

Keywords

  • Information theoretic secrecy
  • Interference
  • Noisy network coding
  • Relay-eavesdropper channel

Fingerprint

Dive into the research topics of 'Achievable Secrecy Rates for Relay-Eavesdropper Channel Based on the Application of Noisy Network Coding'. Together they form a unique fingerprint.

Cite this