40 research outputs found
A Note on the Secrecy Capacity of the Multi-antenna Wiretap Channel
Recently, the secrecy capacity of the multi-antenna wiretap channel was
characterized by Khisti and Wornell [1] using a Sato-like argument. This note
presents an alternative characterization using a channel enhancement argument.
This characterization relies on an extremal entropy inequality recently proved
in the context of multi-antenna broadcast channels, and is directly built on
the physical intuition regarding to the optimal transmission strategy in this
communication scenario.Comment: 10 pages, 0 figure
Secure Transmission for Relay Wiretap Channels in the Presence of Spatially Random Eavesdroppers
We propose a secure transmission scheme for a relay wiretap channel, where a
source communicates with a destination via a decode-and-forward relay in the
presence of spatially random-distributed eavesdroppers. We assume that the
source is equipped with multiple antennas, whereas the relay, the destination,
and the eavesdroppers are equipped with a single antenna each. In the proposed
scheme, in addition to information signals, the source transmits artificial
noise signals in order to confuse the eavesdroppers. With the target of
maximizing the secrecy throughput of the relay wiretap channel, we derive a
closed-form expression for the transmission outage probability and an
easy-to-compute expression for the secrecy outage probability. Using these
expressions, we determine the optimal power allocation factor and wiretap code
rates that guarantee the maximum secrecy throughput, while satisfying a secrecy
outage probability constraint. Furthermore, we examine the impact of source
antenna number on the secrecy throughput, showing that adding extra transmit
antennas at the source brings about a significant increase in the secrecy
throughput.Comment: 7 pages, 5 figures, accepted by IEEE Globecom 2015 Workshop on
Trusted Communications with Physical Layer Securit
Artificial Noise-Aided Biobjective Transmitter Optimization for Service Integration in Multi-User MIMO Gaussian Broadcast Channel
This paper considers an artificial noise (AN)-aided transmit design for
multi-user MIMO systems with integrated services. Specifically, two sorts of
service messages are combined and served simultaneously: one multicast message
intended for all receivers and one confidential message intended for only one
receiver and required to be perfectly secure from other unauthorized receivers.
Our interest lies in the joint design of input covariances of the multicast
message, confidential message and artificial noise (AN), such that the
achievable secrecy rate and multicast rate are simultaneously maximized. This
problem is identified as a secrecy rate region maximization (SRRM) problem in
the context of physical-layer service integration. Since this bi-objective
optimization problem is inherently complex to solve, we put forward two
different scalarization methods to convert it into a scalar optimization
problem. First, we propose to prefix the multicast rate as a constant, and
accordingly, the primal biobjective problem is converted into a secrecy rate
maximization (SRM) problem with quality of multicast service (QoMS) constraint.
By varying the constant, we can obtain different Pareto optimal points. The
resulting SRM problem can be iteratively solved via a provably convergent
difference-of-concave (DC) algorithm. In the second method, we aim to maximize
the weighted sum of the secrecy rate and the multicast rate. Through varying
the weighted vector, one can also obtain different Pareto optimal points. We
show that this weighted sum rate maximization (WSRM) problem can be recast into
a primal decomposable form, which is amenable to alternating optimization (AO).
Then we compare these two scalarization methods in terms of their overall
performance and computational complexity via theoretical analysis as well as
numerical simulation, based on which new insights can be drawn.Comment: 14 pages, 5 figure
An Overview of Physical Layer Security with Finite-Alphabet Signaling
Providing secure communications over the physical layer with the objective of
achieving perfect secrecy without requiring a secret key has been receiving
growing attention within the past decade. The vast majority of the existing
studies in the area of physical layer security focus exclusively on the
scenarios where the channel inputs are Gaussian distributed. However, in
practice, the signals employed for transmission are drawn from discrete signal
constellations such as phase shift keying and quadrature amplitude modulation.
Hence, understanding the impact of the finite-alphabet input constraints and
designing secure transmission schemes under this assumption is a mandatory step
towards a practical implementation of physical layer security. With this
motivation, this article reviews recent developments on physical layer security
with finite-alphabet inputs. We explore transmit signal design algorithms for
single-antenna as well as multi-antenna wiretap channels under different
assumptions on the channel state information at the transmitter. Moreover, we
present a review of the recent results on secure transmission with discrete
signaling for various scenarios including multi-carrier transmission systems,
broadcast channels with confidential messages, cognitive multiple access and
relay networks. Throughout the article, we stress the important behavioral
differences of discrete versus Gaussian inputs in the context of the physical
layer security. We also present an overview of practical code construction over
Gaussian and fading wiretap channels, and we discuss some open problems and
directions for future research.Comment: Submitted to IEEE Communications Surveys & Tutorials (1st Revision