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

arXiv:1307.2430

On The Fast Fading Multiple-Antenna Gaussian Broadcast Channel with Confidential Messages and Partial CSIT

Pin-Hsun Lin, Chien-Li Su, Hsuan-Jung Su

Published Jul 9, 2013• 0 citations
arXivHTMLPDF

Abstract

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any correct CSI. In this paper we consider a more feasible problem for the transmitter to have eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential messages, where both receivers are legitimate users such that they both are willing to feedback accurate CSI to maintain their secure transmission, and not to be eavesdropped by the other. We assume that only the statistics of the channel state information are known by the transmitter. We first show the necessary condition for the FMGBC-CM not to be degraded to the common wiretap channels. Then we derive the achievable rate region for the FMGBC-CM where the channel input covariance matrices and the inflation factor are left unknown and to be solved. After that we provide an analytical solution to the channel input covariance matrices. We also propose an iterative algorithm to solve the channel input covariance matrices and the inflation factor. Due to the complicated rate region formulae in normal SNR, we resort to low SNR analysis to investigate the characteristics of the channel. Finally, numerical examples show that under perfect secrecy constraint both users can achieve positive rates simultaneously, which verifies our derived necessary condition. Numerical results also elucidate the effectiveness of the analytic solution and proposed algorithm of solving the channel input covariance matrices and the inflation factor under different conditions.

DOI
10.48550/arxiv.1307.2430

Related papers

Secure transmission over fast fading multiple-antenna Gaussian broadcast channel with confidential messages

Chien-Li Su, Pin-Hsun Lin, Hsuan-Jung Su

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at the transmitter, fully or partially. In practice, the eavesdropper may not be motivated to feedback correct CSI. In this paper we consider a more practical problem for the transmitter to have the eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential messages, where there are two receivers both legitimate and willing to feedback accurate CSI to the transmitter to maintain their secure transmission, and not to be eavesdropped by the other. We assume that only the statistics of the channel state information are known by the transmitter. We first derive the achievable rate region for the FMGBC-CM. After that we propose an iterative algorithm to solve the channel input covariance matrices and the inflation factor. Finally, numerical examples show that under perfect secrecy constraint both users can achieve positive rates simultaneously, which verifies our derived necessary condition. Numerical results also elucidate the effectiveness of the proposed algorithm in terms of the convergence speed.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2013•0 citations

On the secrecy rate region of a fading multiple-antenna Gaussian broadcast channel with confidential messages and partial CSIT

Pin-Hsun Lin, Chien-Li Su, Hsuan-Jung Su

In this paper we consider the secure transmission over the fast fading multiple antenna Gaussian broadcast channels with confidential messages (FMGBC-CM), where a multiple-antenna transmitter sends independent confidential messages to two users with information theoretic secrecy and only the statistics of the receivers' channel state information are known at the transmitter. We first use the same marginal property of the FMGBC-CM to classify the non-trivial cases, i.e., those not degraded to the common wiretap channels. We then derive the achievable rate region for the FMGBC-CM by solving the channel input covariance matrices and the inflation factor. Finally, the numerical examples show that under the information-theoretic secrecy requirement, both users can achieve positive rates simultaneously.

arXiv:1206.4767•IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2012•1 citation

On Secrecy Capacity of Fast Fading Multiple-Input Wiretap Channels With Statistical CSIT

Shih-Chun Lin, Pin-Hsun Lin

We consider the secure transmission in ergodic fast Rayleigh fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels are the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by the Gaussian input without prefixing. To attain this result, we form another MISOSE channel for upper-bounding by relaxing the equivocation constraint, and tighten the bound by carefully selecting correlations between the legitimate and eavesdropper channel gains. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix. The key to solve such a stochastic optimization problem is by exploiting the completely monotone property of the secrecy capacity. Finally, we prove that with only statistical CSIT of both channels, the capacity will neither scale with signal-to-noise ratio (SNR) nor the number of antenna. Our numerical results also match these observations and further confirm that having the legitimate CSIT (realizations) is very beneficial to increase the secrecy capacity.

arXiv:1201.2868•IEEE Transactions on Information Forensics and Security•Dec 12, 2012•44 citations

On Secrecy Capacity of Fast Fading MIMOME Wiretap Channels with Statistical CSIT

Shih-Chun Lin, Cheng-Liang Lin

In this paper, we consider secure transmissions in ergodic Rayleigh fast-faded multiple-input multiple-output multiple-antenna-eavesdropper (MIMOME) wiretap channels with only statistical channel state information at the transmitter (CSIT). When the antennas at the legitimate receiver are more than (or equal to) those at the eavesdropper, we prove the first MIMOME secrecy capacity with partial CSIT by establishing a new secrecy capacity upper-bound. The key step is to form an MIMOME degraded channel by dividing the legitimate receiver's channel matrix into two submatrices, and setting one of the submatrices to be the same as the eavesdropper's channel matrix. Next, under the total power constraint over all transmit antennas, we analytically solve the channel-input covariance matrix optimization problem to fully characterize the MIMOME secrecy capacity. Typically, the MIMOME optimization problems are non-concave. However, thanks to the proposed degraded channel, we can transform the stochastic MIMOME optimization problem to be a Schur-concave one and then find its solution. Besides total power constraint, we also investigate the secrecy capacity when the transmitter is subject to the practical per-antenna power constraint. The corresponding optimization problem is even more difficult since it is not Schur-concave. Under the two power constraints considered, the corresponding MIMOME secrecy capacities can both scale with the signal-to-noise ratios (SNR) when the difference between numbers of antennas at legitimate receiver and eavesdropper are large enough. However, when the legitimate receiver and eavesdropper have a single antenna each, such SNR scalings do not exist for both cases.

arXiv:1309.1516•IEEE Transactions on Wireless Communications•Apr 24, 2014•43 citations

Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback

Amal Hyadi, Zouheir Rezki, Mohamed‐Slim Alouini

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the throughput of multi-user broadcast wiretap channels. We consider that the transmitter is only provided by a b -bits feedback of the main channel state information (CSI) sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eavesdropper's CSI but not of its channel's realizations. Under these assumptions of CSI uncertainty, we characterize the ergodic secrecy capacity of the system when a common message is broadcasted to all legitimate receivers, the ergodic secrecy sum-capacity when multiple independent messages are transmitted, and the ergodic secrecy capacity region for the broadcast channel with confidential messages (BCCM). In all three scenarios, we show that as long as the transmitter has some knowledge of the main CSI, obtained even through a 1-bit CSI feedback, a non-zero secrecy rate can still be achieved. The impact of having the feedback sent over a binary erasure channel (BEC) is also investigated for the BCCM case. Here again, and even with the possibility of having the feedback bits erased, a positive secrecy rate can still be achieved as long as the erasure event is not a probability-one event. An asymptotic analysis of the obtained results is provided for the high SNR regime, and the scaling law of the system, when the number of legitimate receivers is large, is also presented.

arXiv:2004.10023•IEEE Transactions on Information Theory•Apr 21, 2020•7 citations

Secure Broadcasting With Imperfect Channel State Information at the Transmitter

Amal Hyadi, Zouheir Rezki, Ashish J. Khisti +1 more

We investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state information (CSI) at the transmitter. In particular, we analyze the effect of the noisy estimation of the main CSI on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. Besides, we consider the realistic case where the transmitter is only aware of the statistics of the eavesdropper's CSI and not of its channel's realizations. First, we discuss the common message transmission case where the source broadcasts the same information to all the receivers, and we provide an upper and a lower bound on the ergodic secrecy capacity. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we prove that a nonzero secrecy rate can still be achieved even when the CSI at the transmitter is noisy. Then, we look at the independent messages case where the transmitter broadcasts multiple messages to the receivers, and each intended user is interested in an independent message. For this case, we present an expression for the achievable secrecy sum-rate and an upper bound on the secrecy sum-capacity and we show that, in the limit of large number of legitimate receivers K, our achievable secrecy sum-rate follows the scaling law log ((1-α)log(K)), where α is the estimation error variance of the main CSI. The special cases of high SNR, perfect and no-main CSI are also analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.

IEEE Transactions on Wireless Communications•Nov 13, 2015•18 citations
In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any correct CSI. In this paper we consider a more feasible problem for the transmitter to have eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential messages, where both receivers are legitimate users such that they both are willing to feedback accurate CSI to maintain their secure transmission, and not to be eavesdropped by the other. We assume that only the statistics of the channel state information are known by the transmitter. We first show the necessary condition for the FMGBC-CM not to be degraded to the common wiretap channels. Then we derive the achievable rate region for the FMGBC-CM where the channel input covariance matrices and the inflation factor are left unknown and to be solved. After that we provide an analytical solution to the channel input covariance matrices. We also propose an iterative algorithm to solve the channel input covariance matrices and the inflation factor. Due to the complicated rate region formulae in normal SNR, we resort to low SNR analysis to investigate the characteristics of the channel. Finally, numerical examples show that under perfect secrecy constraint both users can achieve positive rates simultaneously, which verifies our derived necessary condition. Numerical results also elucidate the effectiveness of the analytic solution and proposed algorithm of solving the channel input covariance matrices and the inflation factor under different conditions.
In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at the transmitter, fully or partially. In practice, the eavesdropper may not be motivated to feedback correct CSI. In this paper we consider a more practical problem for the transmitter to have the eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential messages, where there are two receivers both legitimate and willing to feedback accurate CSI to the transmitter to maintain their secure transmission, and not to be eavesdropped by the other. We assume that only the statistics of the channel state information are known by the transmitter. We first derive the achievable rate region for the FMGBC-CM. After that we propose an iterative algorithm to solve the channel input covariance matrices and the inflation factor. Finally, numerical examples show that under perfect secrecy constraint both users can achieve positive rates simultaneously, which verifies our derived necessary condition. Numerical results also elucidate the effectiveness of the proposed algorithm in terms of the convergence speed.
In this paper we consider the secure transmission over the fast fading multiple antenna Gaussian broadcast channels with confidential messages (FMGBC-CM), where a multiple-antenna transmitter sends independent confidential messages to two users with information theoretic secrecy and only the statistics of the receivers' channel state information are known at the transmitter. We first use the same marginal property of the FMGBC-CM to classify the non-trivial cases, i.e., those not degraded to the common wiretap channels. We then derive the achievable rate region for the FMGBC-CM by solving the channel input covariance matrices and the inflation factor. Finally, the numerical examples show that under the information-theoretic secrecy requirement, both users can achieve positive rates simultaneously.
We consider the secure transmission in ergodic fast Rayleigh fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels are the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by the Gaussian input without prefixing. To attain this result, we form another MISOSE channel for upper-bounding by relaxing the equivocation constraint, and tighten the bound by carefully selecting correlations between the legitimate and eavesdropper channel gains. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix. The key to solve such a stochastic optimization problem is by exploiting the completely monotone property of the secrecy capacity. Finally, we prove that with only statistical CSIT of both channels, the capacity will neither scale with signal-to-noise ratio (SNR) nor the number of antenna. Our numerical results also match these observations and further confirm that having the legitimate CSIT (realizations) is very beneficial to increase the secrecy capacity.
In this paper, we consider secure transmissions in ergodic Rayleigh fast-faded multiple-input multiple-output multiple-antenna-eavesdropper (MIMOME) wiretap channels with only statistical channel state information at the transmitter (CSIT). When the antennas at the legitimate receiver are more than (or equal to) those at the eavesdropper, we prove the first MIMOME secrecy capacity with partial CSIT by establishing a new secrecy capacity upper-bound. The key step is to form an MIMOME degraded channel by dividing the legitimate receiver's channel matrix into two submatrices, and setting one of the submatrices to be the same as the eavesdropper's channel matrix. Next, under the total power constraint over all transmit antennas, we analytically solve the channel-input covariance matrix optimization problem to fully characterize the MIMOME secrecy capacity. Typically, the MIMOME optimization problems are non-concave. However, thanks to the proposed degraded channel, we can transform the stochastic MIMOME optimization problem to be a Schur-concave one and then find its solution. Besides total power constraint, we also investigate the secrecy capacity when the transmitter is subject to the practical per-antenna power constraint. The corresponding optimization problem is even more difficult since it is not Schur-concave. Under the two power constraints considered, the corresponding MIMOME secrecy capacities can both scale with the signal-to-noise ratios (SNR) when the difference between numbers of antennas at legitimate receiver and eavesdropper are large enough. However, when the legitimate receiver and eavesdropper have a single antenna each, such SNR scalings do not exist for both cases.
In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the throughput of multi-user broadcast wiretap channels. We consider that the transmitter is only provided by a b -bits feedback of the main channel state information (CSI) sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eavesdropper's CSI but not of its channel's realizations. Under these assumptions of CSI uncertainty, we characterize the ergodic secrecy capacity of the system when a common message is broadcasted to all legitimate receivers, the ergodic secrecy sum-capacity when multiple independent messages are transmitted, and the ergodic secrecy capacity region for the broadcast channel with confidential messages (BCCM). In all three scenarios, we show that as long as the transmitter has some knowledge of the main CSI, obtained even through a 1-bit CSI feedback, a non-zero secrecy rate can still be achieved. The impact of having the feedback sent over a binary erasure channel (BEC) is also investigated for the BCCM case. Here again, and even with the possibility of having the feedback bits erased, a positive secrecy rate can still be achieved as long as the erasure event is not a probability-one event. An asymptotic analysis of the obtained results is provided for the high SNR regime, and the scaling law of the system, when the number of legitimate receivers is large, is also presented.
We investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state information (CSI) at the transmitter. In particular, we analyze the effect of the noisy estimation of the main CSI on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. Besides, we consider the realistic case where the transmitter is only aware of the statistics of the eavesdropper's CSI and not of its channel's realizations. First, we discuss the common message transmission case where the source broadcasts the same information to all the receivers, and we provide an upper and a lower bound on the ergodic secrecy capacity. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we prove that a nonzero secrecy rate can still be achieved even when the CSI at the transmitter is noisy. Then, we look at the independent messages case where the transmitter broadcasts multiple messages to the receivers, and each intended user is interested in an independent message. For this case, we present an expression for the achievable secrecy sum-rate and an upper bound on the secrecy sum-capacity and we show that, in the limit of large number of legitimate receivers K, our achievable secrecy sum-rate follows the scaling law log ((1-α)log(K)), where α is the estimation error variance of the main CSI. The special cases of high SNR, perfect and no-main CSI are also analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.