The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jamming
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 404-413
- https://doi.org/10.1109/ita.2007.4357611
Abstract
We consider the general Gaussian multiple access wire-tap channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy measures, termed individual and collective, to reflect the confidence in the system for this multi-access environment. We determine achievable rates such that secrecy to some predetermined degree can be maintained, using Gaussian codebooks. We also find outer bounds for the case when the eavesdropper receives a degraded version of the intended receiver's signal. In the degraded case, Gaussian codewords are shown to achieve the sum capacity for collective constraints. In addition, a TDMA scheme is shown to also achieve sum capacity for both sets of constraints. Numerical results showing the new rate region are presented and compared with the capacity region of the Gaussian multiple-access channel (GMAC) with no secrecy constraints. We then find the secrecy sum-rate maximizing power allocations for the transmitters, and show that a cooperative jamming scheme can be used to increase achievable rates in this scenario.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Secrecy Capacity of Wireless ChannelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Secrecy Capacities for Multiple TerminalsIEEE Transactions on Information Theory, 2004
- Coding for relay channels with confidential messagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Common randomness in information theory and cryptography. II. CR capacityIEEE Transactions on Information Theory, 1998
- The common randomness capacity of a pair of independent discrete memoryless channelsIEEE Transactions on Information Theory, 1998
- A coding theorem for secret sharing communication systems with two Gaussian wiretap channelsIEEE Transactions on Information Theory, 1991
- On secret sharing communication systems with two or three channelsIEEE Transactions on Information Theory, 1986
- The Gaussian wire-tap channelIEEE Transactions on Information Theory, 1978