Two-hop secure communication using an untrusted Relay: A case for cooperative jamming

Xiang He, Aylin Yener

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    74 Citations (Scopus)

    Abstract

    We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation from the relay node is essential, we investigate whether achieving non-zero secrecy rate is possible. Specifically, we treat the relay node as an eavesdropper from whom the source information needs to be kept secret, despite the fact that its cooperation in relaying this information is needed. We find that a positive secrecy rate is indeed achievable, with the aid of the destination node or an external node that jams the relay, i.e., by cooperative jamming. We derive an upper bound on the secrecy rate by means of an eavesdropper-relay separation argument. We remark that this upper bound is the first of its kind in Gaussian channels with cooperative jamming. The upper bound is strictly smaller than the channel capacity without secrecy constraints. The achievable secrecy rates are found using stochastic encoding and compress-and-forward at the relay. Numerical results show that the gap between the bound and the achievable rate is small when the relay's power is larger than the power of the jammer and the source. In essence, this paper shows that a cooperative jammer enables secure communication to take place using an untrusted relay which would be otherwise impossible.

    Original languageEnglish (US)
    Title of host publication2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
    Pages936-940
    Number of pages5
    DOIs
    StatePublished - Dec 1 2008
    Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
    Duration: Nov 30 2008Dec 4 2008

    Publication series

    NameGLOBECOM - IEEE Global Telecommunications Conference

    Other

    Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
    CountryUnited States
    CityNew Orleans, LA
    Period11/30/0812/4/08

    Fingerprint

    Jamming
    Channel capacity
    Communication
    Secure communication

    All Science Journal Classification (ASJC) codes

    • Electrical and Electronic Engineering

    Cite this

    He, X., & Yener, A. (2008). Two-hop secure communication using an untrusted Relay: A case for cooperative jamming. In 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 (pp. 936-940). [4697960] (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2008.ECP.185
    He, Xiang ; Yener, Aylin. / Two-hop secure communication using an untrusted Relay : A case for cooperative jamming. 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008. 2008. pp. 936-940 (GLOBECOM - IEEE Global Telecommunications Conference).
    @inproceedings{cb3b0d9c2c33414a9a5b3cb1c3e75eb7,
    title = "Two-hop secure communication using an untrusted Relay: A case for cooperative jamming",
    abstract = "We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation from the relay node is essential, we investigate whether achieving non-zero secrecy rate is possible. Specifically, we treat the relay node as an eavesdropper from whom the source information needs to be kept secret, despite the fact that its cooperation in relaying this information is needed. We find that a positive secrecy rate is indeed achievable, with the aid of the destination node or an external node that jams the relay, i.e., by cooperative jamming. We derive an upper bound on the secrecy rate by means of an eavesdropper-relay separation argument. We remark that this upper bound is the first of its kind in Gaussian channels with cooperative jamming. The upper bound is strictly smaller than the channel capacity without secrecy constraints. The achievable secrecy rates are found using stochastic encoding and compress-and-forward at the relay. Numerical results show that the gap between the bound and the achievable rate is small when the relay's power is larger than the power of the jammer and the source. In essence, this paper shows that a cooperative jammer enables secure communication to take place using an untrusted relay which would be otherwise impossible.",
    author = "Xiang He and Aylin Yener",
    year = "2008",
    month = "12",
    day = "1",
    doi = "10.1109/GLOCOM.2008.ECP.185",
    language = "English (US)",
    isbn = "9781424423248",
    series = "GLOBECOM - IEEE Global Telecommunications Conference",
    pages = "936--940",
    booktitle = "2008 IEEE Global Telecommunications Conference, GLOBECOM 2008",

    }

    He, X & Yener, A 2008, Two-hop secure communication using an untrusted Relay: A case for cooperative jamming. in 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008., 4697960, GLOBECOM - IEEE Global Telecommunications Conference, pp. 936-940, 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, New Orleans, LA, United States, 11/30/08. https://doi.org/10.1109/GLOCOM.2008.ECP.185

    Two-hop secure communication using an untrusted Relay : A case for cooperative jamming. / He, Xiang; Yener, Aylin.

    2008 IEEE Global Telecommunications Conference, GLOBECOM 2008. 2008. p. 936-940 4697960 (GLOBECOM - IEEE Global Telecommunications Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Two-hop secure communication using an untrusted Relay

    T2 - A case for cooperative jamming

    AU - He, Xiang

    AU - Yener, Aylin

    PY - 2008/12/1

    Y1 - 2008/12/1

    N2 - We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation from the relay node is essential, we investigate whether achieving non-zero secrecy rate is possible. Specifically, we treat the relay node as an eavesdropper from whom the source information needs to be kept secret, despite the fact that its cooperation in relaying this information is needed. We find that a positive secrecy rate is indeed achievable, with the aid of the destination node or an external node that jams the relay, i.e., by cooperative jamming. We derive an upper bound on the secrecy rate by means of an eavesdropper-relay separation argument. We remark that this upper bound is the first of its kind in Gaussian channels with cooperative jamming. The upper bound is strictly smaller than the channel capacity without secrecy constraints. The achievable secrecy rates are found using stochastic encoding and compress-and-forward at the relay. Numerical results show that the gap between the bound and the achievable rate is small when the relay's power is larger than the power of the jammer and the source. In essence, this paper shows that a cooperative jammer enables secure communication to take place using an untrusted relay which would be otherwise impossible.

    AB - We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation from the relay node is essential, we investigate whether achieving non-zero secrecy rate is possible. Specifically, we treat the relay node as an eavesdropper from whom the source information needs to be kept secret, despite the fact that its cooperation in relaying this information is needed. We find that a positive secrecy rate is indeed achievable, with the aid of the destination node or an external node that jams the relay, i.e., by cooperative jamming. We derive an upper bound on the secrecy rate by means of an eavesdropper-relay separation argument. We remark that this upper bound is the first of its kind in Gaussian channels with cooperative jamming. The upper bound is strictly smaller than the channel capacity without secrecy constraints. The achievable secrecy rates are found using stochastic encoding and compress-and-forward at the relay. Numerical results show that the gap between the bound and the achievable rate is small when the relay's power is larger than the power of the jammer and the source. In essence, this paper shows that a cooperative jammer enables secure communication to take place using an untrusted relay which would be otherwise impossible.

    UR - http://www.scopus.com/inward/record.url?scp=67249087217&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=67249087217&partnerID=8YFLogxK

    U2 - 10.1109/GLOCOM.2008.ECP.185

    DO - 10.1109/GLOCOM.2008.ECP.185

    M3 - Conference contribution

    AN - SCOPUS:67249087217

    SN - 9781424423248

    T3 - GLOBECOM - IEEE Global Telecommunications Conference

    SP - 936

    EP - 940

    BT - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008

    ER -

    He X, Yener A. Two-hop secure communication using an untrusted Relay: A case for cooperative jamming. In 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008. 2008. p. 936-940. 4697960. (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2008.ECP.185