End-to-end secure multi-hop communication with untrusted relays

Xiang He, Aylin Yener

    Research output: Contribution to journalArticle

    30 Citations (Scopus)

    Abstract

    A multi-hop line network is considered, where each node can receive signals transmitted by its two neighbors. As such, the model embodies both the interference and broadcast aspects of wireless networks. The leftmost node wishes to send messages to the rightmost node, while keeping these messages confidential from all the intermediate relay nodes. In this setting where any or all of the relay nodes can be eavesdroppers, it is shown that end-to-end secure and reliable communication is possible. Notably, it is shown that an end-to-end secrecy rate that is independent of the number of hops, i.e., intermediate eavesdroppers, is achievable by means of a carefully designed transmission schedule, compute-and-forward relaying and coding strategy utilizing nested lattice codes. The achievable rate obtained indicates that imposing secrecy constraints penalizes the capacity by at most 1 bit per channel use. Therefore, it is concluded that information theoretic secrecy can be guaranteed for this model irrespective of eavesdropping relays and a fixed modest cost for the end-to-end rate.

    Original languageEnglish (US)
    Article number6378495
    Pages (from-to)1-11
    Number of pages11
    JournalIEEE Transactions on Wireless Communications
    Volume12
    Issue number1
    DOIs
    StatePublished - Jan 1 2013

    Fingerprint

    Multi-hop
    Relay
    Communication
    Vertex of a graph
    Wireless networks
    Costs
    Broadcast
    Wireless Networks
    Schedule
    Coding
    Interference
    Line
    Model

    All Science Journal Classification (ASJC) codes

    • Computer Science Applications
    • Electrical and Electronic Engineering
    • Applied Mathematics

    Cite this

    @article{619fb976f12b404c8df74aed12f7a620,
    title = "End-to-end secure multi-hop communication with untrusted relays",
    abstract = "A multi-hop line network is considered, where each node can receive signals transmitted by its two neighbors. As such, the model embodies both the interference and broadcast aspects of wireless networks. The leftmost node wishes to send messages to the rightmost node, while keeping these messages confidential from all the intermediate relay nodes. In this setting where any or all of the relay nodes can be eavesdroppers, it is shown that end-to-end secure and reliable communication is possible. Notably, it is shown that an end-to-end secrecy rate that is independent of the number of hops, i.e., intermediate eavesdroppers, is achievable by means of a carefully designed transmission schedule, compute-and-forward relaying and coding strategy utilizing nested lattice codes. The achievable rate obtained indicates that imposing secrecy constraints penalizes the capacity by at most 1 bit per channel use. Therefore, it is concluded that information theoretic secrecy can be guaranteed for this model irrespective of eavesdropping relays and a fixed modest cost for the end-to-end rate.",
    author = "Xiang He and Aylin Yener",
    year = "2013",
    month = "1",
    day = "1",
    doi = "10.1109/TWC.2012.120412.101358",
    language = "English (US)",
    volume = "12",
    pages = "1--11",
    journal = "IEEE Transactions on Wireless Communications",
    issn = "1536-1276",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "1",

    }

    End-to-end secure multi-hop communication with untrusted relays. / He, Xiang; Yener, Aylin.

    In: IEEE Transactions on Wireless Communications, Vol. 12, No. 1, 6378495, 01.01.2013, p. 1-11.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - End-to-end secure multi-hop communication with untrusted relays

    AU - He, Xiang

    AU - Yener, Aylin

    PY - 2013/1/1

    Y1 - 2013/1/1

    N2 - A multi-hop line network is considered, where each node can receive signals transmitted by its two neighbors. As such, the model embodies both the interference and broadcast aspects of wireless networks. The leftmost node wishes to send messages to the rightmost node, while keeping these messages confidential from all the intermediate relay nodes. In this setting where any or all of the relay nodes can be eavesdroppers, it is shown that end-to-end secure and reliable communication is possible. Notably, it is shown that an end-to-end secrecy rate that is independent of the number of hops, i.e., intermediate eavesdroppers, is achievable by means of a carefully designed transmission schedule, compute-and-forward relaying and coding strategy utilizing nested lattice codes. The achievable rate obtained indicates that imposing secrecy constraints penalizes the capacity by at most 1 bit per channel use. Therefore, it is concluded that information theoretic secrecy can be guaranteed for this model irrespective of eavesdropping relays and a fixed modest cost for the end-to-end rate.

    AB - A multi-hop line network is considered, where each node can receive signals transmitted by its two neighbors. As such, the model embodies both the interference and broadcast aspects of wireless networks. The leftmost node wishes to send messages to the rightmost node, while keeping these messages confidential from all the intermediate relay nodes. In this setting where any or all of the relay nodes can be eavesdroppers, it is shown that end-to-end secure and reliable communication is possible. Notably, it is shown that an end-to-end secrecy rate that is independent of the number of hops, i.e., intermediate eavesdroppers, is achievable by means of a carefully designed transmission schedule, compute-and-forward relaying and coding strategy utilizing nested lattice codes. The achievable rate obtained indicates that imposing secrecy constraints penalizes the capacity by at most 1 bit per channel use. Therefore, it is concluded that information theoretic secrecy can be guaranteed for this model irrespective of eavesdropping relays and a fixed modest cost for the end-to-end rate.

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

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

    U2 - 10.1109/TWC.2012.120412.101358

    DO - 10.1109/TWC.2012.120412.101358

    M3 - Article

    VL - 12

    SP - 1

    EP - 11

    JO - IEEE Transactions on Wireless Communications

    JF - IEEE Transactions on Wireless Communications

    SN - 1536-1276

    IS - 1

    M1 - 6378495

    ER -