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

International Conference on Communications

Secure Communication through Nakagami-m Fading MISO Channel

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

Published Jun 1, 2011• 10 citations
Publisher

Abstract

We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with information-theoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.

DOI
10.1109/icc.2011.5963506

Related papers

Secure Communications over Wireless Networks

Md. Zahurul I. Sarkar

Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.

IGI Global eBooks•Jan 1, 2012•0 citations

Secure wireless multicasting through Nakagami-m fading MISO channel

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

In the group-oriented applications such as military and commercial wireless cellular networks often require the same data to be conveyed to multiple users simultaneously. This technique is usually referred to as physical layer multicasting. In this paper, we consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) channel, where a single transmitter sends a common and confidential message to a group of receivers in the presence of an eavesdropper. We are interested in protecting this message from eavesdropping. At first, we define the secrecy multicast capacity for a K-receiver multicast channel at which the eavesdropper is unable to decode any information from the multicast channels and find the analytical expression for the lower bound of average secrecy multicast capacity. Then, we define the secrecy multicast capacity in terms of secure outage probability, and find the analytical expressions for the probability of non-zero secrecy multicast capacity and secure outage probability to study the outage behavior of the proposed model.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•11 citations

Secrecy capacity and secure outage performance for rayleigh fading simo channel

Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah

In this paper, we consider the problem of secret communication through Rayleigh fading single-input multiple-output (SIMO) broadcast channel in the presence of an eavesdropper. At first, we define the ergodic secrecy capacity and find the optimal power allocation at the transmitter that achieves the secrecy capacity for the full channel state information (CSI) case, where transmitter has access to both the main channel and eavesdropper's channel gains, and for the case of only main channel CSI at the transmitter. Then, we define the secrecy capacity in case of open-loop transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. We also find the analytical expression for secure outage probability to study the secure outage performance of the proposed model.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2011•9 citations

Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages

Ruoheng Liu, H. Vincent Poor

Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multiple-antenna transmitter wishes to send independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multiple-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.

IEEE Transactions on Information Theory•Feb 26, 2009•266 citations

On the Secrecy Mutual Information of Nakagami-m Fading SIMO Channel

M. Z. I. Sarkar, Tharmalingam Ratnarajah

In this paper, we consider the transmission of confidential message through non-identically and identically independent Nakagami-m fading single-input multiple-output (SIMO) channel in the presence of an eavesdropper. We are interested in protecting this message against eavesdropping i.e. the information is secure if it cannot be eavesdropped by any eavesdropper. Based on the problem of secure communications between transmitter and intended receiver over Nakagami-m fading channel where an eavesdropper observes their transmissions through another Nakagami-m fading channel, we derive the analytical expressions for the probability of non-zero secrecy mutual information, secure outage probability and ergodic secrecy mutual information of SIMO wireless communication systems over non-identically and identically independent Nakagami-m fading subchannels. Numerical results are presented and verified via Monte-Carlo simulation.

International Conference on Communications•May 1, 2010•20 citations

Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel with Confidential Messages

Ruoheng Liu, H. Vincent Poor

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound prove to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.

arXiv:0709.4671•Sep 28, 2007•11 citations
We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with information-theoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.
Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.
In the group-oriented applications such as military and commercial wireless cellular networks often require the same data to be conveyed to multiple users simultaneously. This technique is usually referred to as physical layer multicasting. In this paper, we consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) channel, where a single transmitter sends a common and confidential message to a group of receivers in the presence of an eavesdropper. We are interested in protecting this message from eavesdropping. At first, we define the secrecy multicast capacity for a K-receiver multicast channel at which the eavesdropper is unable to decode any information from the multicast channels and find the analytical expression for the lower bound of average secrecy multicast capacity. Then, we define the secrecy multicast capacity in terms of secure outage probability, and find the analytical expressions for the probability of non-zero secrecy multicast capacity and secure outage probability to study the outage behavior of the proposed model.
In this paper, we consider the problem of secret communication through Rayleigh fading single-input multiple-output (SIMO) broadcast channel in the presence of an eavesdropper. At first, we define the ergodic secrecy capacity and find the optimal power allocation at the transmitter that achieves the secrecy capacity for the full channel state information (CSI) case, where transmitter has access to both the main channel and eavesdropper's channel gains, and for the case of only main channel CSI at the transmitter. Then, we define the secrecy capacity in case of open-loop transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. We also find the analytical expression for secure outage probability to study the secure outage performance of the proposed model.
Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multiple-antenna transmitter wishes to send independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multiple-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.
In this paper, we consider the transmission of confidential message through non-identically and identically independent Nakagami-m fading single-input multiple-output (SIMO) channel in the presence of an eavesdropper. We are interested in protecting this message against eavesdropping i.e. the information is secure if it cannot be eavesdropped by any eavesdropper. Based on the problem of secure communications between transmitter and intended receiver over Nakagami-m fading channel where an eavesdropper observes their transmissions through another Nakagami-m fading channel, we derive the analytical expressions for the probability of non-zero secrecy mutual information, secure outage probability and ergodic secrecy mutual information of SIMO wireless communication systems over non-identically and identically independent Nakagami-m fading subchannels. Numerical results are presented and verified via Monte-Carlo simulation.
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound prove to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.