The gaussian many-to-one interference channel with confidential messages

Xiang He, Aylin Yener

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

    3 Citations (Scopus)

    Abstract

    We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

    Original languageEnglish (US)
    Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
    Pages2086-2090
    Number of pages5
    DOIs
    StatePublished - Nov 19 2009
    Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
    Duration: Jun 28 2009Jul 3 2009

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    ISSN (Print)2157-8102

    Other

    Other2009 IEEE International Symposium on Information Theory, ISIT 2009
    CountryKorea, Republic of
    CitySeoul
    Period6/28/097/3/09

    Fingerprint

    Many to one
    Interference Channel
    Power transmission
    Interference
    Upper bound
    User Experience

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Information Systems
    • Modeling and Simulation
    • Applied Mathematics

    Cite this

    He, X., & Yener, A. (2009). The gaussian many-to-one interference channel with confidential messages. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2086-2090). [5205291] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205291
    He, Xiang ; Yener, Aylin. / The gaussian many-to-one interference channel with confidential messages. 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. pp. 2086-2090 (IEEE International Symposium on Information Theory - Proceedings).
    @inproceedings{87f6a352f4414a5da5e9bc088ce0ca22,
    title = "The gaussian many-to-one interference channel with confidential messages",
    abstract = "We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.",
    author = "Xiang He and Aylin Yener",
    year = "2009",
    month = "11",
    day = "19",
    doi = "10.1109/ISIT.2009.5205291",
    language = "English (US)",
    isbn = "9781424443130",
    series = "IEEE International Symposium on Information Theory - Proceedings",
    pages = "2086--2090",
    booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

    }

    He, X & Yener, A 2009, The gaussian many-to-one interference channel with confidential messages. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205291, IEEE International Symposium on Information Theory - Proceedings, pp. 2086-2090, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205291

    The gaussian many-to-one interference channel with confidential messages. / He, Xiang; Yener, Aylin.

    2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 2086-2090 5205291 (IEEE International Symposium on Information Theory - Proceedings).

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

    TY - GEN

    T1 - The gaussian many-to-one interference channel with confidential messages

    AU - He, Xiang

    AU - Yener, Aylin

    PY - 2009/11/19

    Y1 - 2009/11/19

    N2 - We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

    AB - We investigate the K -user many-to-one interference channel with confidential messages in which the Kth user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

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

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

    U2 - 10.1109/ISIT.2009.5205291

    DO - 10.1109/ISIT.2009.5205291

    M3 - Conference contribution

    SN - 9781424443130

    T3 - IEEE International Symposium on Information Theory - Proceedings

    SP - 2086

    EP - 2090

    BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

    ER -

    He X, Yener A. The gaussian many-to-one interference channel with confidential messages. In 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 2086-2090. 5205291. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205291