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

Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
1 Downloads (Pure)

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 it is receiving from the source. In the external eavesdropper case, the relay is trusted, and there is an external node eavesdropping the communication. 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 the high signal-to-noise-ratio (SNR) scenario and/or the limited 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.
Original languageEnglish
Pages (from-to)7753-7769
Number of pages17
JournalIEEE transactions on information theory
Volume63
Issue number12
DOIs
Publication statusPublished - 1 Dec 2017

Fingerprint

Relay Channel
secrecy
Relay
Signal to noise ratio
Communication
Channel capacity
Jamming
scenario
communication
Chain Code
Upper bound
Binning
Scenarios
Channel Capacity
Vertex of a graph

Keywords

  • Compute-and-forward
  • lattice codes
  • two-hop
  • untrusted relay
  • information theoretic security

Cite this

Ren, Zhijie ; Goseling, Jasper ; Weber, Jos H. ; Gastpar, Michael. / Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward. In: IEEE transactions on information theory. 2017 ; Vol. 63, No. 12. pp. 7753-7769.
@article{1681d48857ea4753af778ff8251d78d1,
title = "Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward",
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 it is receiving from the source. In the external eavesdropper case, the relay is trusted, and there is an external node eavesdropping the communication. 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 the high signal-to-noise-ratio (SNR) scenario and/or the limited 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.",
keywords = "Compute-and-forward, lattice codes, two-hop, untrusted relay, information theoretic security",
author = "Zhijie Ren and Jasper Goseling and Weber, {Jos H.} and Michael Gastpar",
year = "2017",
month = "12",
day = "1",
doi = "10.1109/TIT.2017.2757503",
language = "English",
volume = "63",
pages = "7753--7769",
journal = "IEEE transactions on information theory",
issn = "0018-9448",
publisher = "IEEE",
number = "12",

}

Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward. / Ren, Zhijie; Goseling, Jasper ; Weber, Jos H.; Gastpar, Michael.

In: IEEE transactions on information theory, Vol. 63, No. 12, 01.12.2017, p. 7753-7769.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - Ren, Zhijie

AU - Goseling, Jasper

AU - Weber, Jos H.

AU - Gastpar, Michael

PY - 2017/12/1

Y1 - 2017/12/1

N2 - 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 it is receiving from the source. In the external eavesdropper case, the relay is trusted, and there is an external node eavesdropping the communication. 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 the high signal-to-noise-ratio (SNR) scenario and/or the limited 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.

AB - 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 it is receiving from the source. In the external eavesdropper case, the relay is trusted, and there is an external node eavesdropping the communication. 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 the high signal-to-noise-ratio (SNR) scenario and/or the limited 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.

KW - Compute-and-forward

KW - lattice codes

KW - two-hop

KW - untrusted relay

KW - information theoretic security

U2 - 10.1109/TIT.2017.2757503

DO - 10.1109/TIT.2017.2757503

M3 - Article

VL - 63

SP - 7753

EP - 7769

JO - IEEE transactions on information theory

JF - IEEE transactions on information theory

SN - 0018-9448

IS - 12

ER -