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

Journal of Telecommunications and Information Technology

Secrecy Rate Region Enhancement in Multiple Access Wiretap Channel

Shahid Mehraj Shah

Published Jun 30, 2022• 1 citation
Publisher

Abstract

It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels. To mitigate such rate losses in multi-user channels, we propose a coding/decoding scheme for multi-user multiple access wiretap channel (MAC-WT), where previously transmitted messages are used as a secret key to enhance the secrecy rates of the transmitting users, until the usual Shannon capacity region of a multiple access channel (MAC) is achieved without the secrecy constraint. With this coding scheme, all messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal, we introduce secret key buffers at both the users and the legitimate receiver. Finally, we consider a fading MAC-WT and show that with this coding/decoding scheme, we can achieve the capacity region of a fading MAC channel (in the ergodic sense).

DOI
10.26636/jtit.2022.152021

Related papers

Mitigating Rate Loss in Fading Multiple Access Wiretap Channel to achieve Shannon Capacity Region

Shahid Mehraj Shah, Vinod Sharma

Security constraint results in rate-loss in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme only the message that is being transmitted is proved to be secure with respect to all the information that the adversary (eavesdropper) possesses. In the second part of the paper we improve the security constraint such that not only the message being transmitted is secure but all the messages transmitted in the immediate past are secure w.r.t. all the information o f the eavesdropper. To achieve this goal we introduce secret key buffers at both the users, as well as at the legitimate receiver (Bob). Finally we consider a fading MAC-WT and show that with this coding/decoding scheme we can achieve the capacity region of a fading MAC (in ergodic sense).

arXiv:1505.02085•May 8, 2015•0 citations

Achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel

Shahid Mehraj Shah, Vinod Sharma

We consider a two user multiple-access channel with an eavesdropper at the receiving end. We use previously transmitted messages as a key in the next slot till we achieve the capacity region of the usual multiple access channel (MAC).

arXiv:1410.8794•IEEE Wireless Communications and Networking Conference•Mar 1, 2015•3 citations

Achieving Shannon Capacity in a Fading Wiretap Channel.

Shahid Mehraj Shah, Vinod Sharma

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also in addition to reliability, results in decrease of the achievable rate. To mitigate the loss in the secrecy rate, we propose a coding scheme paper where we use sufficiently old messages as key and for this scheme prove that multiple messages are secure with respect to (w.r.t.) all the information possessed by the eavesdropper. We also show that we can achieve security in the strong sense. Next we consider a fading wiretap channel with full channel state information of the eavesdropper's channel and use our coding/decoding scheme to achieve secrecy capacity close to the Shannon capacity of the main channel (in the ergodic sense). Finally we also consider the case where the transmitter does not have the instantaneous information of the channel state of the eavesdropper, but only its distribution.

arXiv:1505.01374•May 6, 2015•1 citation

An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages

Hao Xu, Giuseppe Caire, Cunhua Pan

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver but only the confidential messages need to be protected from the eavesdropper. By using random coding, we find an achievable secrecy rate region, within which perfect secrecy can be realized, i.e., all users can communicate with the legitimate receiver with arbitrarily small probability of error, while the confidential information leaked to the eavesdropper tends to zero.

arXiv:2001.03722•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•6 citations

Achievable Regions and Precoder Designs for the Multiple Access Wiretap Channels With Confidential and Open Messages

Hao Xu, Tianyu Yang, Kai‐Kit Wong +1 more

This paper investigates the secrecy achievable region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver (or Bob for brevity) but only the confidential messages need to be protected from the eavesdropper (Eve). We first consider a discrete memoryless (DM) MAC-WT channel where both Bob and Eve jointly decode their interested messages. By using random coding, we find an achievable rate region, within which perfect secrecy can be realized, i.e., all users can communicate with Bob with arbitrarily small probability of error, while the confidential information leaked to Eve tends to zero. Due to the high implementation complexity of joint decoding, we also consider the DM MAC-WT channel where Bob simply decodes messages independently while Eve still applies joint decoding. We then extend the results in the DM case to a Gaussian vector (GV) MAC-WT channel. Based on the information theoretic results, we further maximize the sum secrecy rate of the GV MAC-WT system by designing precoders for all users. Since the problems are non-convex, we provide iterative algorithms to obtain suboptimal solutions. Simulation results show that compared with existing schemes, secure communication can be greatly enhanced by the proposed algorithms, and in contrast to the works which only focus on the network secrecy performance, the system spectrum efficiency can be effectively improved since open messages can be simultaneously transmitted.

arXiv:2107.14163•IEEE Journal on Selected Areas in Communications•Jan 27, 2022•14 citations

Some New Results on the Multiple-AccessWiretap Channel

Bin Dai, Zheng Ma

In this paper, some new results on the multiple-access wiretap channel (MAC-WT) are provided. Specifically, first, we investigate the degraded MAC-WT, where two users transmit their corresponding confidential messages (no common message) to a legitimate receiver via a multiple-access channel (MAC), while a wiretapper wishes to obtain the messages via a physically degraded wiretap channel. The secrecy capacity region of this model is determined for both the discrete memoryless and Gaussian cases. For the Gaussian case, we find that this secrecy capacity region is exactly the same as the achievable secrecy rate region provided by Tekin and Yener, i.e., Tekin–Yener’s achievable region is exactly the secrecy capacity region of the degraded Gaussian MAC-WT. Second, we study a special Gaussian MAC-WT, and find the power control for two kinds of optimal points (max-min point and single user point) on the secrecy rate region of this special Gaussian model.

Entropy•Aug 21, 2014•5 citations
It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels. To mitigate such rate losses in multi-user channels, we propose a coding/decoding scheme for multi-user multiple access wiretap channel (MAC-WT), where previously transmitted messages are used as a secret key to enhance the secrecy rates of the transmitting users, until the usual Shannon capacity region of a multiple access channel (MAC) is achieved without the secrecy constraint. With this coding scheme, all messages transmitted in the recent past are secure with respect to all the information of the eavesdropper till now. To achieve this goal, we introduce secret key buffers at both the users and the legitimate receiver. Finally, we consider a fading MAC-WT and show that with this coding/decoding scheme, we can achieve the capacity region of a fading MAC channel (in the ergodic sense).
Security constraint results in rate-loss in wiretap channels. In this paper we propose a coding scheme for two user Multiple Access Channel with Wiretap (MAC-WT), where previous messages are used as a key to enhance the secrecy rates of both the users until we achieve the usual capacity region of a Multiple Access Channel (MAC) without the wiretapper (Shannon capacity region). With this scheme only the message that is being transmitted is proved to be secure with respect to all the information that the adversary (eavesdropper) possesses. In the second part of the paper we improve the security constraint such that not only the message being transmitted is secure but all the messages transmitted in the immediate past are secure w.r.t. all the information o f the eavesdropper. To achieve this goal we introduce secret key buffers at both the users, as well as at the legitimate receiver (Bob). Finally we consider a fading MAC-WT and show that with this coding/decoding scheme we can achieve the capacity region of a fading MAC (in ergodic sense).
Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also in addition to reliability, results in decrease of the achievable rate. To mitigate the loss in the secrecy rate, we propose a coding scheme paper where we use sufficiently old messages as key and for this scheme prove that multiple messages are secure with respect to (w.r.t.) all the information possessed by the eavesdropper. We also show that we can achieve security in the strong sense. Next we consider a fading wiretap channel with full channel state information of the eavesdropper's channel and use our coding/decoding scheme to achieve secrecy capacity close to the Shannon capacity of the main channel (in the ergodic sense). Finally we also consider the case where the transmitter does not have the instantaneous information of the channel state of the eavesdropper, but only its distribution.
This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver but only the confidential messages need to be protected from the eavesdropper. By using random coding, we find an achievable secrecy rate region, within which perfect secrecy can be realized, i.e., all users can communicate with the legitimate receiver with arbitrarily small probability of error, while the confidential information leaked to the eavesdropper tends to zero.
This paper investigates the secrecy achievable region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate receiver (or Bob for brevity) but only the confidential messages need to be protected from the eavesdropper (Eve). We first consider a discrete memoryless (DM) MAC-WT channel where both Bob and Eve jointly decode their interested messages. By using random coding, we find an achievable rate region, within which perfect secrecy can be realized, i.e., all users can communicate with Bob with arbitrarily small probability of error, while the confidential information leaked to Eve tends to zero. Due to the high implementation complexity of joint decoding, we also consider the DM MAC-WT channel where Bob simply decodes messages independently while Eve still applies joint decoding. We then extend the results in the DM case to a Gaussian vector (GV) MAC-WT channel. Based on the information theoretic results, we further maximize the sum secrecy rate of the GV MAC-WT system by designing precoders for all users. Since the problems are non-convex, we provide iterative algorithms to obtain suboptimal solutions. Simulation results show that compared with existing schemes, secure communication can be greatly enhanced by the proposed algorithms, and in contrast to the works which only focus on the network secrecy performance, the system spectrum efficiency can be effectively improved since open messages can be simultaneously transmitted.
In this paper, some new results on the multiple-access wiretap channel (MAC-WT) are provided. Specifically, first, we investigate the degraded MAC-WT, where two users transmit their corresponding confidential messages (no common message) to a legitimate receiver via a multiple-access channel (MAC), while a wiretapper wishes to obtain the messages via a physically degraded wiretap channel. The secrecy capacity region of this model is determined for both the discrete memoryless and Gaussian cases. For the Gaussian case, we find that this secrecy capacity region is exactly the same as the achievable secrecy rate region provided by Tekin and Yener, i.e., Tekin–Yener’s achievable region is exactly the secrecy capacity region of the degraded Gaussian MAC-WT. Second, we study a special Gaussian MAC-WT, and find the power control for two kinds of optimal points (max-min point and single user point) on the secrecy rate region of this special Gaussian model.