The Gaussian multiple access wire-tap channel with collective secrecy constraints

Ender Tekin, Aylin Yener

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

    35 Scopus citations

    Abstract

    We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define a suitable security measure for this multi-access environment. We derive an outer bound for the rate region such that secrecy to some pre-determined degree can be maintained. We also find, using Gaussian codebooks, an achievable such secrecy region. Gaussian codewords are shown to achieve the sum capacity outer bound, and the achievable region concides with the outer bound for Gaussian codewords, giving the capacity region when inputs are constrained to be Gaussian. We present numerical results showing the new rate region and compare it with that of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints.

    Original languageEnglish (US)
    Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
    Pages1164-1168
    Number of pages5
    DOIs
    StatePublished - Dec 1 2006
    Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
    Duration: Jul 9 2006Jul 14 2006

    Publication series

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

    Other

    Other2006 IEEE International Symposium on Information Theory, ISIT 2006
    CountryUnited States
    CitySeattle, WA
    Period7/9/067/14/06

    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 multiple access wire-tap channel with collective secrecy constraints'. Together they form a unique fingerprint.

  • Cite this

    Tekin, E., & Yener, A. (2006). The Gaussian multiple access wire-tap channel with collective secrecy constraints. In Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006 (pp. 1164-1168). [4036148] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2006.261988