Achievable secrecy sum-rate in a fading MAC-WT with power control and without CSI of eavesdropper

Shah, Shahid Mehraj; Kumar, Vineeth; Sharma, Vinod

doi:10.1109/spcom.2012.6290033

Cited by 6 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare the NBS and the PP with the case when CSI of the transmitters is known globally but only the distribution of Eve's channel gains are known at all transmitters. This case is studied in [17] for continuous channel states and a centralized solution which maximizes the sum rate is found. We also find the Bayesian Equilibrium (BE) for the case when each user knows distribution of all the channel gains to Eve, as done in [8] for F-MAC without security constraints.…”

Section: Fig ??)mentioning

confidence: 99%

“…More recently in [16] the authors have studied a compound MAC-WT and have characterized inner and outer bounds on the secrecy capacity region. In [17] the authors have studied a fading MAC-WT with full CSI of Eve and also when each user knows the channel state of all the users to the receiver, but is ignorant of the instantaneous value of channel state to the eavesdropper (only its distribution is known). But knowing other users' channel gains to the legitimate receiver may also not be practical: it needs a lot of signalling overhead and feedback information.…”

Section: Introductionmentioning

confidence: 99%

“…To the best of our knowledge this is the first paper which is using game theory on MAC-WT. Finally we compare the sum-rates obtained via all these algorithms to the global CSI case and also with the sum-rate obtained in [17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Resource allocation in a MAC with and without security via game theoretic learning

Shah

Chaitanya

Sharma³

2017

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

In this paper we study a K-user fading MAC, with and without an eavesdropper (Eve). In the system without Eve, we assume that each user knows only its own channel gain and is completely ignorant about the other users' channel state. The legitimate receiver sends a short acknowledgement message ACK if the message is correctly decoded and a NACK if the message is not correctly decoded. Under these assumptions we use game theoretic learning setup to make transmitters learn about the power allocation under each state. We use multiplicative weight no-regret algorithm to achieve an ǫ-coarse correlated equilibrium. We also consider the case where a user can receive other users' ACK/NACK messages. Now we can maximize a weighted sum-utility and achieve Pareto optimal points. We also obtain Nash bargaining solutions, which are Pareto points that are fairer to the transmitting users.With Eve, we first assume each user knows only its own channel gain to the receiver as well as to Eve. The receiver decides whether to send an ACK or a NACK to the transmitting user based on the Part of the paper was presented in IEEE Information theory and applications (ITA) workshop 2016,

show abstract

Section: Fig ??)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Resource allocation in a MAC with and without security via game theoretic learning

Shah

Chaitanya

Sharma³

2017

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…The same authors also studied a fading MAC with full channel state information (CSI) of Eve known at the transmitters. Paper [7] is a research extension of a scenario in which the CSI of Eve is not known at the transmitters. For a detailed review of theoretical information theoretic security see [8], [9], and [10].…”

Section: Introductionmentioning

confidence: 99%

Secrecy Rate Region Enhancement in Multiple Access Wiretap Channel

Shah¹

2022

JTIT

View full text Add to dashboard Cite

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).

show abstract

“…The same authors also studied a fading MAC with full channel state information (CSI) of Eve known at the transmitters. In [7] this work is extended to the case when the CSI of Eve is not known at the transmitters. For a detailed review on information theoretic security, see [8], [9], and [10].…”

mentioning

confidence: 99%

Enhancing Secrecy Rate Region for Recent Messages for a Slotted Multiple Access Wiretap Channel to Shannon Capacity Region

Shah¹,

Sharma²

2015

Preprint

Self Cite

View full text Add to dashboard Cite

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 all the 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, 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).

show abstract

Achievable secrecy sum-rate in a fading MAC-WT with power control and without CSI of eavesdropper

Cited by 6 publications

References 22 publications

Resource allocation in a MAC with and without security via game theoretic learning

Resource allocation in a MAC with and without security via game theoretic learning

Secrecy Rate Region Enhancement in Multiple Access Wiretap Channel

Enhancing Secrecy Rate Region for Recent Messages for a Slotted Multiple Access Wiretap Channel to Shannon Capacity Region

Contact Info

Product

Resources

About