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

Xiang He, Aylin Yener

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

    3 Scopus citations

    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

    All Science Journal Classification (ASJC) codes

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

    Fingerprint Dive into the research topics of 'The gaussian many-to-one interference channel with confidential messages'. Together they form a unique fingerprint.

  • 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