Multi-Terminal Two-Hop Untrusted-Relay Networks with Hierarchical Security Guarantees

Ahmed A. Zewail, Aylin Yener

    Research output: Contribution to journalArticle

    8 Citations (Scopus)

    Abstract

    We consider a two-source two-destination two-hop relay network, where all data communication must be kept secret from the relay node. The model considered is the simplest primitive that embodies a multi-Transmitter multi-receiver network that needs to communicate sharing an untrusted relay node. We focus on two scenarios. In the first scenario, each source aims to send two messages to be kept secret from the relay: A common message that should be decoded by both destinations, and a private message that should be decoded by the first destination while kept secret from the second one. We define an achievable rate region by utilizing stochastic encoding at the sources, the Gaussian noise cooperative jamming from the destinations, and compress-And-forward at the relay. In the second scenario, each source aims to send a confidential message to its intended destination, which should be kept secret from the other one as well as the relay. We define an achievable rate region using a combination of nested lattice codes and random binning at the sources, structured cooperative jamming from destinations, and scaled compute-And-forward at the relay. We also derive genie-Aided outer bounds on the secrecy rate regions. We present numerical results that demonstrate the performance of the proposed achievable schemes. Overall, this paper provides insights into how to utilize an untrusted relay to communicate to destinations with different levels of security clearance, and how intentional interference is an enabler of communication.

    Original languageEnglish (US)
    Article number7903628
    Pages (from-to)2052-2066
    Number of pages15
    JournalIEEE Transactions on Information Forensics and Security
    Volume12
    Issue number9
    DOIs
    StatePublished - Sep 1 2017

    Fingerprint

    Jamming
    Gaussian noise (electronic)
    Communication
    Transmitters

    All Science Journal Classification (ASJC) codes

    • Safety, Risk, Reliability and Quality
    • Computer Networks and Communications

    Cite this

    @article{e3a080ae29f9423a8c56f4d2d1e31e10,
    title = "Multi-Terminal Two-Hop Untrusted-Relay Networks with Hierarchical Security Guarantees",
    abstract = "We consider a two-source two-destination two-hop relay network, where all data communication must be kept secret from the relay node. The model considered is the simplest primitive that embodies a multi-Transmitter multi-receiver network that needs to communicate sharing an untrusted relay node. We focus on two scenarios. In the first scenario, each source aims to send two messages to be kept secret from the relay: A common message that should be decoded by both destinations, and a private message that should be decoded by the first destination while kept secret from the second one. We define an achievable rate region by utilizing stochastic encoding at the sources, the Gaussian noise cooperative jamming from the destinations, and compress-And-forward at the relay. In the second scenario, each source aims to send a confidential message to its intended destination, which should be kept secret from the other one as well as the relay. We define an achievable rate region using a combination of nested lattice codes and random binning at the sources, structured cooperative jamming from destinations, and scaled compute-And-forward at the relay. We also derive genie-Aided outer bounds on the secrecy rate regions. We present numerical results that demonstrate the performance of the proposed achievable schemes. Overall, this paper provides insights into how to utilize an untrusted relay to communicate to destinations with different levels of security clearance, and how intentional interference is an enabler of communication.",
    author = "Zewail, {Ahmed A.} and Aylin Yener",
    year = "2017",
    month = "9",
    day = "1",
    doi = "10.1109/TIFS.2017.2695163",
    language = "English (US)",
    volume = "12",
    pages = "2052--2066",
    journal = "IEEE Transactions on Information Forensics and Security",
    issn = "1556-6013",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "9",

    }

    Multi-Terminal Two-Hop Untrusted-Relay Networks with Hierarchical Security Guarantees. / Zewail, Ahmed A.; Yener, Aylin.

    In: IEEE Transactions on Information Forensics and Security, Vol. 12, No. 9, 7903628, 01.09.2017, p. 2052-2066.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Multi-Terminal Two-Hop Untrusted-Relay Networks with Hierarchical Security Guarantees

    AU - Zewail, Ahmed A.

    AU - Yener, Aylin

    PY - 2017/9/1

    Y1 - 2017/9/1

    N2 - We consider a two-source two-destination two-hop relay network, where all data communication must be kept secret from the relay node. The model considered is the simplest primitive that embodies a multi-Transmitter multi-receiver network that needs to communicate sharing an untrusted relay node. We focus on two scenarios. In the first scenario, each source aims to send two messages to be kept secret from the relay: A common message that should be decoded by both destinations, and a private message that should be decoded by the first destination while kept secret from the second one. We define an achievable rate region by utilizing stochastic encoding at the sources, the Gaussian noise cooperative jamming from the destinations, and compress-And-forward at the relay. In the second scenario, each source aims to send a confidential message to its intended destination, which should be kept secret from the other one as well as the relay. We define an achievable rate region using a combination of nested lattice codes and random binning at the sources, structured cooperative jamming from destinations, and scaled compute-And-forward at the relay. We also derive genie-Aided outer bounds on the secrecy rate regions. We present numerical results that demonstrate the performance of the proposed achievable schemes. Overall, this paper provides insights into how to utilize an untrusted relay to communicate to destinations with different levels of security clearance, and how intentional interference is an enabler of communication.

    AB - We consider a two-source two-destination two-hop relay network, where all data communication must be kept secret from the relay node. The model considered is the simplest primitive that embodies a multi-Transmitter multi-receiver network that needs to communicate sharing an untrusted relay node. We focus on two scenarios. In the first scenario, each source aims to send two messages to be kept secret from the relay: A common message that should be decoded by both destinations, and a private message that should be decoded by the first destination while kept secret from the second one. We define an achievable rate region by utilizing stochastic encoding at the sources, the Gaussian noise cooperative jamming from the destinations, and compress-And-forward at the relay. In the second scenario, each source aims to send a confidential message to its intended destination, which should be kept secret from the other one as well as the relay. We define an achievable rate region using a combination of nested lattice codes and random binning at the sources, structured cooperative jamming from destinations, and scaled compute-And-forward at the relay. We also derive genie-Aided outer bounds on the secrecy rate regions. We present numerical results that demonstrate the performance of the proposed achievable schemes. Overall, this paper provides insights into how to utilize an untrusted relay to communicate to destinations with different levels of security clearance, and how intentional interference is an enabler of communication.

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

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

    U2 - 10.1109/TIFS.2017.2695163

    DO - 10.1109/TIFS.2017.2695163

    M3 - Article

    AN - SCOPUS:85028337438

    VL - 12

    SP - 2052

    EP - 2066

    JO - IEEE Transactions on Information Forensics and Security

    JF - IEEE Transactions on Information Forensics and Security

    SN - 1556-6013

    IS - 9

    M1 - 7903628

    ER -