Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Secrecy capacity of a class of broadcast channels with an eavesdropper
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Erratum to "the Gaussian multiple access wire-tap channel"
IEEE Transactions on Information Theory
A new achievable ergodic secrecy rate region for the fading multiple access wiretap channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Ergodic secrecy capacity region of the fading broadcast channel
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Cooperation with an untrusted relay: a secrecy perspective
IEEE Transactions on Information Theory
Two-hop secure communication using an untrusted relay
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
MAC with partially cooperating encoders and security constraints
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Control of wireless networks with secrecy
IEEE/ACM Transactions on Networking (TON)
Strong secrecy for multiple access channels
Information Theory, Combinatorics, and Search Theory
| Hi-index | 755.02 |
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.