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

Xiang He, Aylin Yener

    Research output: Contribution to journalArticlepeer-review

    21 Scopus citations

    Abstract

    The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general Κ-user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subject to interference, is also one from which the interfering users' messages need to be kept secret from. We derive the achievable secrecy sum rate for this channel using nested lattice codes, as well as an upper bound on the secrecy sum rate for all possible channel gain configurations. We identify several nontrivial cases where the gap between the upper bound and the achieved secrecy sum rate is only a function of the number of the users $K$, and is uniform over all possible channel gain configurations in each case. In addition, we identify the secure degrees of freedom for this channel and show it to be equivalent to its degrees of freedom, i.e., the secrecy in high SNR comes for free.

    Original languageEnglish (US)
    Article number5752454
    Pages (from-to)2730-2745
    Number of pages16
    JournalIEEE Transactions on Information Theory
    Volume57
    Issue number5
    DOIs
    StatePublished - May 2011

    All Science Journal Classification (ASJC) codes

    • Information Systems
    • Computer Science Applications
    • Library and Information Sciences

    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