Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward

From MaRDI portal
Publication:4566604

DOI10.1109/TIT.2017.2757503zbMATH Open1390.94778arXiv1509.04075OpenAlexW2963961871MaRDI QIDQ4566604FDOQ4566604


Authors: Zhijie Ren, Jasper Goseling, J. H. Weber, Michael C. Gastpar Edit this on Wikidata


Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: In this paper, we consider communication on a two-hop channel, in which a source wants to send information reliably and securely to the destination via a relay. We consider both the untrusted relay case and the external eavesdropper case. In the untrusted relay case, the relay behaves as an eavesdropper and there is a cooperative node which sends a jamming signal to confuse the relay when the it is receiving from the source. We propose two secure transmission schemes using the scaled compute-and-forward technique. One of the schemes is based on a random binning code and the other one is based on a lattice chain code. It is proved that in either the high Signal-to-Noise-Ratio (SNR) scenario and/or the restricted relay power scenario, if the destination is used as the jammer, both schemes outperform all existing schemes and achieve the upper bound. In particular, if the SNR is large and the source, the relay, and the cooperative jammer have identical power and channels, both schemes achieve the upper bound for secrecy rate, which is merely 1/2 bit per channel use lower than the channel capacity without secrecy constraints. We also prove that one of our schemes achieves a positive secrecy rate in the external eavesdropper case in which the relay is trusted and there exists an external eavesdropper.


Full work available at URL: https://arxiv.org/abs/1509.04075




Recommendations




Cited In (1)





This page was built for publication: Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566604)