Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy
| dc.creator | Tekin, Ender | |
| dc.creator | Yener, Aylin | |
| dc.date | 2006-12-18 | |
| dc.date.accessioned | 2026-07-07T08:16:53Z | |
| dc.date.available | 2026-07-07T08:16:53Z | |
| dc.description | 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 who is as capable as the intended receiver, but has different channel parameters. We aim to provide perfect secrecy for the transmitters in this multi-access environment. Using Gaussian codebooks, an achievable secrecy region is determined and the power allocation that maximizes the achievable sum-rate is found. Numerical results showing the new rate region are presented. It is shown that the multiple-access nature of the channel may be utilized to allow users with zero single-user secrecy capacity to be able to transmit in perfect secrecy. In addition, a new collaborative scheme is shown that may increase the achievable sum-rate. In this scheme, a user who would not transmit to maximize the sum rate can help another user who (i) has positive secrecy capacity to increase its rate, or (ii) has zero secrecy capacity to achieve a positive secrecy capacity. | |
| dc.description | Presented at the 44th Annual Allerton Conference on Communication, Control, and Computing, September 27-29, 2006 | |
| dc.identifier | https://arxiv.org/abs/cs/0612084 | |
| dc.identifier | http://arxiv.org/abs/cs/0612084 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133939 | |
| dc.subject | Information Theory | |
| dc.subject | Cryptography and Security | |
| dc.title | Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy | |
| dc.type | text |