The Gaussian Multiple Access Wire-Tap Channel
Top Cited Papers
- 25 November 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (12) , 5747-5755
- https://doi.org/10.1109/tit.2008.2006422
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 suitable security measures for this multiaccess environment. Using codebooks generated randomly according to a Gaussian distribution, achievable secrecy rate regions are identified using superposition coding and time-division multiple access (TDMA) coding schemes. An upper bound for the secrecy sum-rate is derived, and our coding schemes are shown to achieve the sum capacity. Numerical results are presented showing the new rate region and comparing it with the capacity region of the Gaussian multiple-access channel (GMAC) with no secrecy constraints, which quantifies the price paid for secrecy.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative JammingIEEE Transactions on Information Theory, 2008
- Secrecy Capacities for Multiple TerminalsIEEE Transactions on Information Theory, 2004
- Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness resultIEEE Transactions on Information Theory, 2003
- Secret-key agreement over unauthenticated public channels-part II: the simulatability conditionIEEE Transactions on Information Theory, 2003
- Secret-key agreement over unauthenticated public channels-part III: privacy amplificationIEEE Transactions on Information Theory, 2003
- The wire-tap channel concept against eavesdropping of indoor radio telephonePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Elements of Information TheoryPublished by Wiley ,2001
- Common randomness and secret key generation with a helperIEEE Transactions on Information Theory, 2000
- The common randomness capacity of a network of discrete memoryless channelsIEEE Transactions on Information Theory, 2000
- The common randomness capacity of a pair of independent discrete memoryless channelsIEEE Transactions on Information Theory, 1998