TY - GEN
T1 - Achievable rates for the general Gaussian multiple access wire-tap channel with collective secrecy
AU - Tekin, Ender
AU - Yener, Aylin
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84940659555&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84940659555&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84940659555
T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006
SP - 809
EP - 816
BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006
PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
T2 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006
Y2 - 27 September 2006 through 29 September 2006
ER -