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

Analysis of Secrecy in Multi-User Wireless Network

Anirban Ghosh

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

We consider an Ergodic Fading Broadcast Channel with one Legitimate receiver and one Eavesdropper (BCoLoE) having arbitrary fading statistics, where the instantaneous Channel State Information (CSI) are known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to-Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds with the help of numerical computation for several BCoLoEs with practical fading statistics. We further characterize the secrecy capacity of a class of 2-user binary fading interference channel (BFIC) and 2-user layered fading interference channel (LFIC), under the same assumptions as for the wiretap channel. The secrecy capacity region for a very weak BFIC turns out to be quadrangular while for LFIC it is polygonal. We explicitly characterize the corner points in both the cases. The converse in either case is proved by dividing the set of upper bounds into two carefully chosen regions depending on the values of ω - the weighting factor of the weighted sum bounds. In case of LFIC each of the regions are also shown to be piece-wise linear. The achievability on the other hand is proved by using capacity optimal code for a layered erasure wiretap channel at both the transmitters and treating interference as erasure while decoding the signals at the receivers. In addition, the achievability of the layered case also involves proper assignment of the layers to the two transmitters based on some constraints. We also prove the secrecy capacity of strong BFIC and LFIC as zero.

Related papers

Secrecy Capacity of the Fast Fading SISO Wiretap Channel within 11 Bits with Only CSIR

Sanjay Karmakar, Anirban Ghosh

We consider a fast fading 2-receiver Broadcast channel (BC), where one of the receivers is legitimate and the other is malicious/unintended. The instantaneous Channel State Information (CSI) is assumed to be known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to- Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions and has the desirable property of easy computability for arbitrary fading statistics. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds. This result establishes BES-RS scheme as a practically implementable coding scheme that can achieve the secrecy capacity of the FWC within a constant number of bits, where the constant is universal across all fading statistics and SNR. Explicit numerical computation of these bounds shows that the difference between the secrecy rate achievable by the BES-RS scheme and the upper bound is much smaller than the aforementioned universal constant. This in turn suggests that, much of the gap of 11 bits originates from the looseness introduced to bring the two bounds in a compatible form.

International Conference on Communications•May 1, 2018•0 citations

Secrecy Capacity Region of Fading Binary Z Interference Channel With Statistical CSIT

Sanjay Karmakar, Anirban Ghosh

We characterize the secrecy capacity region of a fast Fading Binary 2-user Z-Interference Channel (FBZIC), assuming that only the Statistical Channel State Information is available at the Transmitters (S-CSIT). The converse is proved by constructing a new channel which is stochastically stronger than both the direct and cross-links emerging from the interfering transmitter. We also show that a capacity optimal code for a point-to-point binary erasure channel can be used at the non-interfering transmitter, a secrecy capacity optimal code for a binary erasure wiretap channel can be used at the interfering transmitter, and received signals can be decoded treating interference as erasure, to achieve all the secrecy rate pairs within the secrecy capacity region of the FBZIC. It turns out that the secrecy capacity region is a trapezoid and we explicitly characterize its corner points in terms of erasure probabilities of the various links of the channel. Comparing it with the capacity region of a fast fading no-secrecy binary 2-user ZIC, we quantify the loss due to the additional secrecy constraint. Our results reveal that, when the non-interfering user operates at its maximum rate, the interfering user cannot operate at a non-zero secrecy rate.

IEEE Transactions on Information Forensics and Security•Aug 21, 2018•4 citations

Information-theoretic Secrecy in Multi-user Channels

Ersen Ekrem

Inherent openness of the wireless medium imposes stronger challenges on the security of wireless communications. Information-theoretic security addresses these challenges at the physical layer by using tools from wireless communication theory, signal processing and information theory. In information-theoretic security, physical layer communication is intelligently designed to exploit the characteristics of the wireless medium, such as fading, interference, cooperation, and multi-dimensional signaling, in order to provide or improve security. In this dissertation, we study the security of several fundamental wireless network configurations from an information-theoretic perspective. First, we study the Gaussian multiple-input multiple-output (MIMO) wiretap channel. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. In addition to the common message, a private message is sent only to the legitimate user, which needs to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region for this channel model. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due to Csiszar-Korner. Next, we study the secure broadcasting problem, where a transmitter wants to have secure communication with multiple legitimate users in the presence of an external eavesdropper. We study several special cases of the secure broadcasting problem. First, we consider the degraded multi-receiver wiretap channel, and establish its secrecy capacity region. Second, we consider the parallel less noisy multi-receiver wiretap channel, and obtain its common message secrecy capacity and sum secrecy capacity. Third, we consider the parallel degraded multi-receiver wiretap channel for the two-user and two-sub-channel case, and obtain its entire secrecy capacity region. Finally, we consider a parallel channel model with two sub-channels, where the transmitter can use only one of the subchannels at any time, and characterize its secrecy capacity region. Then, we study the two-user Gaussian MIMO broadcast channel with common and confidential messages. In this channel model, the transmitter sends a common message to both users, and a confidential message to each user which needs to be kept perfectly secret from the other user. We obtain the entire capacity region of this channel. We also explore the connections between this channel model and its non-confidential counterpart, i.e., the Gaussian MIMO broadcast channel with common and private message. Next, we consider the Gaussian MIMO multi-receiver wiretap channel and obtain its secrecy capacity region for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques fall short of proving the secrecy capacity region, to emphasize the need for a new proof technique, which we develop by using the relationships between the Fisher information and the differential entropy. Using this new proof technique, we obtain the secrecy capacity region of the degraded MIMO channel. We then establish the secrecy capacity region of the general MIMO channel by using the channel enhancement technique in conjunction with the capacity result we obtained for the degraded MIMO channel. For the general MIMO channel, we show that dirty-paper coding (DPC) combined with stochastic encoding attains the entire secrecy capacity region. Then, we study the multi-receiver wiretap channel for a more general scenario, where, in addition to confidential messages, the transmitter sends public messages to the legitimate users, on which there are no secrecy constraints. First, we consider the degraded discrete memoryless channel, and obtain inner and outer bounds for the capacity region. These inner and outer bounds match for certain cases, providing the capacity region. Second, we obtain an inner bound for the general discrete memoryless channel by using Marton's inner bound. Third, we consider the degraded Gaussian MIMO channel, and show that jointly Gaussian auxiliary random variables and channel input are sufficient to exhaust the inner and outer bounds. Finally, we provide an inner bound for the capacity region of the general Gaussian MIMO channel. Next, we focus on the multiple access wiretap (MAC-WT) channel whose capacity region is unknown. We consider a special class of MAC-WT channels which we call the weak eavesdropper class, where each user's link to the legitimate receiver is stronger than its link to the eavesdropper. For this class of channels, we develop an outer bound for the secrecy capacity region, which partially matches the achievable region in an n-letter form. We evaluate a looser version of our outer bound for the Gaussian case, and show that our outer bound is within 0.5 bits/channel use of the achievable rates along the individual secrecy rates for all weak eavesdropper Gaussian MAC-WT. Then, we investigate the effects of user cooperation on the secrecy of broadcast channels by considering the cooperative relay broadcast channel (CRBC). We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward (CAF) scheme for relay channels. For the Gaussian CRBC, we show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation. We further investigate the effects of user cooperation on secrecy by considering the multiple access channel with generalized feedback (MAC-GF), which can be viewed as the MAC-dual of the CRBC. We propose a CAF-based achievable secrecy rate region for the MAC-GF. Specializing our results to a Gaussian MAC-GF, we present numerical results which demonstrate that cooperation can improve secrecy for the MAC-GF. Next, we study the two-user one-eavesdropper discrete memoryless compound wiretap channel, and provide the best known lower bound for the secrecy capacity of this compound channel. We evaluate this achievable secrecy rate for the Gaussian MIMO case by using DPC. We show that this achievable secrecy rate achieves at least half of the secrecy capacity of this Gaussian MIMO compound wiretap channel, and also attains the secrecy capacity when the eavesdropper is degraded with respect to one of the two users. Then, we study the degraded compound multi-receiver wiretap channel (DCMRWC), which, in addition to a group of eavesdroppers, has two groups of users, namely the stronger group and the weaker group. We study two different communication scenarios for this channel. In the first scenario, there is only one eavesdropper, and the transmitter sends a confidential message to each group of legitimate users while keeping both messages secret from the eavesdropper. In the second scenario, we study the DCMRWC with layered messages without any restriction on the number of eavesdroppers. For both scenarios, we obtain the secrecy capacity region for the discrete memoryless channel, the parallel channel, and the Gaussian parallel channel. For the Gaussian MIMO channel, we obtain the secrecy capacity region when there is only one user in the second group. Next, we study the two-user fading broadcast channel and obtain its ergodic secrecy capacity region. We show that, thanks to fading, both users can have simultaneous secure communication with the transmitter, although this is not possible in the scalar non-fading Gaussian broadcast channel where only one user can have secure communication. This simultaneous secrecy of both users is achieved by an opportunistic communication scheme, in which, at each time instant, the transmitter communicates with the user having a better channel gain. Then, we study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. We obtain an outer bound for the rate, equivocation and distortion region. Moreover, we obtain the maximum equivocation at the eavesdropper when there is no constraint on the transmission rate. By using this maximum equivocation result, we show two facts. First, for this problem, in general, Wyner-Ziv scheme is suboptimal, although, it is optimal in the absence of an eavesdropper. And, second, even when there is no transmission rate constraint, an uncoded transmission scheme is suboptimal; the presence of an eavesdropper necessitates the use of a coded scheme to attain the maximum equivocation. Finally, we revisit the secure lossy source coding problem. In all works on this problem, either the equivocation of the source at the eavesdropper or the equivocation of the legitimate user's reconstruction of the source at the eavesdropper is used to measure secrecy. We first propose the relative equivocation of the source at the eavesdropper with respect to the legitimate user as a new secrecy measure. We argue that this new secrecy measure is the one that corresponds to the natural generalization of the equivocation in a wiretap channel to the context of secure lossy source coding. Under this new secrecy measure, we provide a single-letter description of the rate, relative equivocation and distortion region, as well as its specializations to degraded and reversely degraded cases. We investigate the relationships between the optimal scheme that attains this region and the Wyner-Ziv scheme.

•Jan 1, 2012•0 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

Secrecy capacity of the ergodic layered erasure wiretap channel

Mohammad K. Hossan, Sanjay Karmakar

We consider the layered erasure wiretap channel which can also be viewed as the time varying version of the deterministic model of the wiretap channel and characterize its secrecy capacity. We assume an arbitrary fading statistics for the erasure probabilities of the layers and assume that only the fading statistics is known at the transmitter while the instantaneous erasure information, i.e., which layers are erased in a particular channel use, is known at both the receivers. The converse is based on an enhancement technique where we first construct an enhanced wiretap channel and then derive upper bound to the secrecy capacity of the enhanced channel. On the achievability side we show that a coding scheme, in which information is transmitted only via a subset of the layers chosen carefully depending on the channel statistics and independent coding is done across different layers in this subset, can achieve the upper bound.

Conference on Information Sciences and Systems•Mar 1, 2015•4 citations

On the Secrecy Capacity of Fading Channels

Praveen Kumar Gopala, Lifeng Lai, Hesham El Gamal

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.

arXiv:cs/0610103•IEEE Transactions on Information Theory•Sep 18, 2008•1,252 citations
We consider an Ergodic Fading Broadcast Channel with one Legitimate receiver and one Eavesdropper (BCoLoE) having arbitrary fading statistics, where the instantaneous Channel State Information (CSI) are known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to-Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds with the help of numerical computation for several BCoLoEs with practical fading statistics. We further characterize the secrecy capacity of a class of 2-user binary fading interference channel (BFIC) and 2-user layered fading interference channel (LFIC), under the same assumptions as for the wiretap channel. The secrecy capacity region for a very weak BFIC turns out to be quadrangular while for LFIC it is polygonal. We explicitly characterize the corner points in both the cases. The converse in either case is proved by dividing the set of upper bounds into two carefully chosen regions depending on the values of ω - the weighting factor of the weighted sum bounds. In case of LFIC each of the regions are also shown to be piece-wise linear. The achievability on the other hand is proved by using capacity optimal code for a layered erasure wiretap channel at both the transmitters and treating interference as erasure while decoding the signals at the receivers. In addition, the achievability of the layered case also involves proper assignment of the layers to the two transmitters based on some constraints. We also prove the secrecy capacity of strong BFIC and LFIC as zero.
We consider a fast fading 2-receiver Broadcast channel (BC), where one of the receivers is legitimate and the other is malicious/unintended. The instantaneous Channel State Information (CSI) is assumed to be known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to- Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions and has the desirable property of easy computability for arbitrary fading statistics. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds. This result establishes BES-RS scheme as a practically implementable coding scheme that can achieve the secrecy capacity of the FWC within a constant number of bits, where the constant is universal across all fading statistics and SNR. Explicit numerical computation of these bounds shows that the difference between the secrecy rate achievable by the BES-RS scheme and the upper bound is much smaller than the aforementioned universal constant. This in turn suggests that, much of the gap of 11 bits originates from the looseness introduced to bring the two bounds in a compatible form.
We characterize the secrecy capacity region of a fast Fading Binary 2-user Z-Interference Channel (FBZIC), assuming that only the Statistical Channel State Information is available at the Transmitters (S-CSIT). The converse is proved by constructing a new channel which is stochastically stronger than both the direct and cross-links emerging from the interfering transmitter. We also show that a capacity optimal code for a point-to-point binary erasure channel can be used at the non-interfering transmitter, a secrecy capacity optimal code for a binary erasure wiretap channel can be used at the interfering transmitter, and received signals can be decoded treating interference as erasure, to achieve all the secrecy rate pairs within the secrecy capacity region of the FBZIC. It turns out that the secrecy capacity region is a trapezoid and we explicitly characterize its corner points in terms of erasure probabilities of the various links of the channel. Comparing it with the capacity region of a fast fading no-secrecy binary 2-user ZIC, we quantify the loss due to the additional secrecy constraint. Our results reveal that, when the non-interfering user operates at its maximum rate, the interfering user cannot operate at a non-zero secrecy rate.
Inherent openness of the wireless medium imposes stronger challenges on the security of wireless communications. Information-theoretic security addresses these challenges at the physical layer by using tools from wireless communication theory, signal processing and information theory. In information-theoretic security, physical layer communication is intelligently designed to exploit the characteristics of the wireless medium, such as fading, interference, cooperation, and multi-dimensional signaling, in order to provide or improve security. In this dissertation, we study the security of several fundamental wireless network configurations from an information-theoretic perspective. First, we study the Gaussian multiple-input multiple-output (MIMO) wiretap channel. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. In addition to the common message, a private message is sent only to the legitimate user, which needs to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region for this channel model. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due to Csiszar-Korner. Next, we study the secure broadcasting problem, where a transmitter wants to have secure communication with multiple legitimate users in the presence of an external eavesdropper. We study several special cases of the secure broadcasting problem. First, we consider the degraded multi-receiver wiretap channel, and establish its secrecy capacity region. Second, we consider the parallel less noisy multi-receiver wiretap channel, and obtain its common message secrecy capacity and sum secrecy capacity. Third, we consider the parallel degraded multi-receiver wiretap channel for the two-user and two-sub-channel case, and obtain its entire secrecy capacity region. Finally, we consider a parallel channel model with two sub-channels, where the transmitter can use only one of the subchannels at any time, and characterize its secrecy capacity region. Then, we study the two-user Gaussian MIMO broadcast channel with common and confidential messages. In this channel model, the transmitter sends a common message to both users, and a confidential message to each user which needs to be kept perfectly secret from the other user. We obtain the entire capacity region of this channel. We also explore the connections between this channel model and its non-confidential counterpart, i.e., the Gaussian MIMO broadcast channel with common and private message. Next, we consider the Gaussian MIMO multi-receiver wiretap channel and obtain its secrecy capacity region for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques fall short of proving the secrecy capacity region, to emphasize the need for a new proof technique, which we develop by using the relationships between the Fisher information and the differential entropy. Using this new proof technique, we obtain the secrecy capacity region of the degraded MIMO channel. We then establish the secrecy capacity region of the general MIMO channel by using the channel enhancement technique in conjunction with the capacity result we obtained for the degraded MIMO channel. For the general MIMO channel, we show that dirty-paper coding (DPC) combined with stochastic encoding attains the entire secrecy capacity region. Then, we study the multi-receiver wiretap channel for a more general scenario, where, in addition to confidential messages, the transmitter sends public messages to the legitimate users, on which there are no secrecy constraints. First, we consider the degraded discrete memoryless channel, and obtain inner and outer bounds for the capacity region. These inner and outer bounds match for certain cases, providing the capacity region. Second, we obtain an inner bound for the general discrete memoryless channel by using Marton's inner bound. Third, we consider the degraded Gaussian MIMO channel, and show that jointly Gaussian auxiliary random variables and channel input are sufficient to exhaust the inner and outer bounds. Finally, we provide an inner bound for the capacity region of the general Gaussian MIMO channel. Next, we focus on the multiple access wiretap (MAC-WT) channel whose capacity region is unknown. We consider a special class of MAC-WT channels which we call the weak eavesdropper class, where each user's link to the legitimate receiver is stronger than its link to the eavesdropper. For this class of channels, we develop an outer bound for the secrecy capacity region, which partially matches the achievable region in an n-letter form. We evaluate a looser version of our outer bound for the Gaussian case, and show that our outer bound is within 0.5 bits/channel use of the achievable rates along the individual secrecy rates for all weak eavesdropper Gaussian MAC-WT. Then, we investigate the effects of user cooperation on the secrecy of broadcast channels by considering the cooperative relay broadcast channel (CRBC). We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward (CAF) scheme for relay channels. For the Gaussian CRBC, we show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation. We further investigate the effects of user cooperation on secrecy by considering the multiple access channel with generalized feedback (MAC-GF), which can be viewed as the MAC-dual of the CRBC. We propose a CAF-based achievable secrecy rate region for the MAC-GF. Specializing our results to a Gaussian MAC-GF, we present numerical results which demonstrate that cooperation can improve secrecy for the MAC-GF. Next, we study the two-user one-eavesdropper discrete memoryless compound wiretap channel, and provide the best known lower bound for the secrecy capacity of this compound channel. We evaluate this achievable secrecy rate for the Gaussian MIMO case by using DPC. We show that this achievable secrecy rate achieves at least half of the secrecy capacity of this Gaussian MIMO compound wiretap channel, and also attains the secrecy capacity when the eavesdropper is degraded with respect to one of the two users. Then, we study the degraded compound multi-receiver wiretap channel (DCMRWC), which, in addition to a group of eavesdroppers, has two groups of users, namely the stronger group and the weaker group. We study two different communication scenarios for this channel. In the first scenario, there is only one eavesdropper, and the transmitter sends a confidential message to each group of legitimate users while keeping both messages secret from the eavesdropper. In the second scenario, we study the DCMRWC with layered messages without any restriction on the number of eavesdroppers. For both scenarios, we obtain the secrecy capacity region for the discrete memoryless channel, the parallel channel, and the Gaussian parallel channel. For the Gaussian MIMO channel, we obtain the secrecy capacity region when there is only one user in the second group. Next, we study the two-user fading broadcast channel and obtain its ergodic secrecy capacity region. We show that, thanks to fading, both users can have simultaneous secure communication with the transmitter, although this is not possible in the scalar non-fading Gaussian broadcast channel where only one user can have secure communication. This simultaneous secrecy of both users is achieved by an opportunistic communication scheme, in which, at each time instant, the transmitter communicates with the user having a better channel gain. Then, we study the secure lossy transmission of a vector Gaussian source to a legitimate user in the presence of an eavesdropper, where both the legitimate user and the eavesdropper have vector Gaussian side information. We obtain an outer bound for the rate, equivocation and distortion region. Moreover, we obtain the maximum equivocation at the eavesdropper when there is no constraint on the transmission rate. By using this maximum equivocation result, we show two facts. First, for this problem, in general, Wyner-Ziv scheme is suboptimal, although, it is optimal in the absence of an eavesdropper. And, second, even when there is no transmission rate constraint, an uncoded transmission scheme is suboptimal; the presence of an eavesdropper necessitates the use of a coded scheme to attain the maximum equivocation. Finally, we revisit the secure lossy source coding problem. In all works on this problem, either the equivocation of the source at the eavesdropper or the equivocation of the legitimate user's reconstruction of the source at the eavesdropper is used to measure secrecy. We first propose the relative equivocation of the source at the eavesdropper with respect to the legitimate user as a new secrecy measure. We argue that this new secrecy measure is the one that corresponds to the natural generalization of the equivocation in a wiretap channel to the context of secure lossy source coding. Under this new secrecy measure, we provide a single-letter description of the rate, relative equivocation and distortion region, as well as its specializations to degraded and reversely degraded cases. We investigate the relationships between the optimal scheme that attains this region and the Wyner-Ziv scheme.
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 consider the layered erasure wiretap channel which can also be viewed as the time varying version of the deterministic model of the wiretap channel and characterize its secrecy capacity. We assume an arbitrary fading statistics for the erasure probabilities of the layers and assume that only the fading statistics is known at the transmitter while the instantaneous erasure information, i.e., which layers are erased in a particular channel use, is known at both the receivers. The converse is based on an enhancement technique where we first construct an enhanced wiretap channel and then derive upper bound to the secrecy capacity of the enhanced channel. On the achievability side we show that a coding scheme, in which information is transmitted only via a subset of the layers chosen carefully depending on the channel statistics and independent coding is done across different layers in this subset, can achieve the upper bound.
We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average signal-to-noise ratio (SNR) goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Overall, channel fading has a positive impact on the secrecy capacity and rate adaptation, based on the main channel CSI, is critical in facilitating secure communications over slow fading channels.