Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Allerton Conference on Communication, Control, and Computing

Secrecy sum-rates for the multiple - Access wire-tap channel with ergodic block fadin

Ender Tekin, Aylin Yener

Published Jan 1, 2007• 0 citations
OpenAlex

Related papers

Ergodic Secrecy Rates of the Full-Duplex AF and DF Relay Wire-Tap Fading Channels

Cuong Hung Dang, Lubna Elsaid, Leonardo Jiménez Rodríguez +2 more

European Wireless Conference•May 18, 2016•1 citation

Secrecy Rate of the Amplify-and-Forward Relay Wire-Tap Channel in Rayleigh Fading

Cuong Hung Dang, Leonardo Jiménez Rodríguez, Duc‐Anh Le +2 more

Lecture notes in electrical engineering•Jan 1, 2015•0 citations

The Gaussian Multiple Access Wire-Tap Channel

Ender Tekin, Aylin Yener

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.

arXiv:cs/0605028•IEEE Transactions on Information Theory•Dec 1, 2008•317 citations

Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy

Ender Tekin, Aylin Yener

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.

arXiv:cs/0612084•Dec 18, 2006•66 citations

The Two-Way MIMO Wire-Tap Channel An Achievable Secrecy Capacity Region

Oussama Souihli, Tomoaki Otsuki Ohtsuki

電子情報通信学会技術研究報告. RCS, 無線通信システム•Feb 25, 2009•0 citations

Secrecy Capacity of Wiretap Channels with the Bit Error Rate Criterion

隆太郎 松本, Ryutaroh Matsumoto

•Jan 1, 2016•0 citations
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.
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.