9 research outputs found
Secure Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay
channel in the presence of a passive eavesdropper. We consider a four terminal
relay-eavesdropper channel which consists of multiple relay-eavesdropper
channels as subchannels. For the discrete memoryless model, we establish outer
and inner bounds on the rate-equivocation region. The inner bound allows mode
selection at the relay. For each subchannel, secure transmission is obtained
through one of two coding schemes at the relay: decoding-and-forwarding the
source message or confusing the eavesdropper through noise injection. For the
Gaussian memoryless channel, we establish lower and upper bounds on the perfect
secrecy rate. Furthermore, we study a special case in which the relay does not
hear the source and show that under certain conditions the lower and upper
bounds coincide. The results established for the parallel Gaussian
relay-eavesdropper channel are then applied to study the fading
relay-eavesdropper channel. Analytical results are illustrated through some
numerical examples.Comment: To Appear in IEEE Transactions on Information Forensics and Securit
Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations
We investigate the transmission of a secret message from Alice to Bob in the
presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes.
Each link comprises a set of parallel channels, modeling for example an
orthogonal frequency division multiplexing transmission. We consider the impact
of discrete constellations and finite-length coding, defining an achievable
secrecy rate under a constraint on the equivocation rate at Eve. Then we
propose a power and channel allocation algorithm that maximizes the achievable
secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable
matching problem. We consider the scenarios of both full and partial channel
state information at Alice. In the latter case, we only guarantee an outage
secrecy rate, i.e., the rate of a message that remains secret with a given
probability. Numerical results are provided for Rayleigh fading channels in
terms of average outage secrecy rate, showing that practical schemes achieve a
performance quite close to that of ideal ones
Secure Degrees of Freedom of MIMO X-Channels with Output Feedback and Delayed CSIT
We investigate the problem of secure transmission over a two-user multi-input
multi-output (MIMO) X-channel in which channel state information is provided
with one-unit delay to both transmitters (CSIT), and each receiver feeds back
its channel output to a different transmitter. We refer to this model as MIMO
X-channel with asymmetric output feedback and delayed CSIT. The transmitters
are equipped with M-antennas each, and the receivers are equipped with
N-antennas each. For this model, accounting for both messages at each receiver,
we characterize the optimal sum secure degrees of freedom (SDoF) region. We
show that, in presence of asymmetric output feedback and delayed CSIT, the sum
SDoF region of the MIMO X-channel is same as the SDoF region of a two-user MIMO
BC with 2M-antennas at the transmitter, N-antennas at each receiver and delayed
CSIT. This result shows that, upon availability of asymmetric output feedback
and delayed CSIT, there is no performance loss in terms of sum SDoF due to the
distributed nature of the transmitters. Next, we show that this result also
holds if only output feedback is conveyed to the transmitters, but in a
symmetric manner, i.e., each receiver feeds back its output to both
transmitters and no CSIT. We also study the case in which only asymmetric
output feedback is provided to the transmitters, i.e., without CSIT, and derive
a lower bound on the sum SDoF for this model. Furthermore, we specialize our
results to the case in which there are no security constraints. In particular,
similar to the setting with security constraints, we show that the optimal sum
DoF region of the (M,M,N,N)--MIMO X-channel with asymmetric output feedback and
delayed CSIT is same as the DoF region of a two-user MIMO BC with 2M-antennas
at the transmitter, N-antennas at each receiver, and delayed CSIT. We
illustrate our results with some numerical examples.Comment: To Appear in IEEE Transactions on Information Forensics and Securit
On SDoF of Multi-Receiver Wiretap Channel With Alternating CSIT
We study the problem of secure transmission over a Gaussian multi-input
single-output (MISO) two receiver channel with an external eavesdropper, under
the assumption that the state of the channel which is available to each
receiver is conveyed either perfectly () or with delay () to the
transmitter. Denoting by , , and the channel state information
at the transmitter (CSIT) of user 1, user 2, and eavesdropper, respectively,
the overall CSIT can then alternate between eight possible states, i.e.,
. We denote by the
fraction of time during which the state occurs. Under these
assumptions, we first consider the Gaussian MISO wiretap channel and
characterize the secure degrees of freedom (SDoF). Next, we consider the
general multi-receiver setup and characterize the SDoF region of fixed hybrid
states , , and . We then focus our attention on the symmetric
case in which . For this case, we establish bounds
on SDoF region. The analysis reveals that alternating CSIT allows synergistic
gains in terms of SDoF; and shows that, by opposition to encoding separately
over different states, joint encoding across the states enables strictly better
secure rates. Furthermore, we specialize our results for the two receivers
channel with an external eavesdropper to the two-user broadcast channel. We
show that, the synergistic gains in terms of SDoF by alternating CSIT is not
restricted to multi-receiver wiretap channels; and, can also be harnessed under
broadcast setting.Comment: To Appear in IEEE Transactions on Information Forensics and Securit
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201