397 research outputs found
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
Jamming Games in the MIMO Wiretap Channel With an Active Eavesdropper
This paper investigates reliable and covert transmission strategies in a
multiple-input multiple-output (MIMO) wiretap channel with a transmitter,
receiver and an adversarial wiretapper, each equipped with multiple antennas.
In a departure from existing work, the wiretapper possesses a novel capability
to act either as a passive eavesdropper or as an active jammer, under a
half-duplex constraint. The transmitter therefore faces a choice between
allocating all of its power for data, or broadcasting artificial interference
along with the information signal in an attempt to jam the eavesdropper
(assuming its instantaneous channel state is unknown). To examine the resulting
trade-offs for the legitimate transmitter and the adversary, we model their
interactions as a two-person zero-sum game with the ergodic MIMO secrecy rate
as the payoff function. We first examine conditions for the existence of
pure-strategy Nash equilibria (NE) and the structure of mixed-strategy NE for
the strategic form of the game.We then derive equilibrium strategies for the
extensive form of the game where players move sequentially under scenarios of
perfect and imperfect information. Finally, numerical simulations are presented
to examine the equilibrium outcomes of the various scenarios considered.Comment: 27 pages, 8 figures. To appear, IEEE Transactions on Signal
Processin
Secure Degrees of Freedom Regions of Multiple Access and Interference Channels: The Polytope Structure
The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user
network structures, the K-user Gaussian multiple access (MAC) wiretap channel
and the K-user interference channel (IC) with secrecy constraints, have been
determined recently as K(K-1)/(K(K-1)+1) [1,2] and K(K-1)/(2K-1) [3,4],
respectively. In this paper, we determine the entire s.d.o.f. regions of these
two channel models. The converse for the MAC follows from a middle step in the
converse of [1,2]. The converse for the IC includes constraints both due to
secrecy as well as due to interference. Although the portion of the region
close to the optimum sum s.d.o.f. point is governed by the upper bounds due to
secrecy constraints, the other portions of the region are governed by the upper
bounds due to interference constraints. Different from the existing literature,
in order to fully understand the characterization of the s.d.o.f. region of the
IC, one has to study the 4-user case, i.e., the 2 or 3-user cases do not
illustrate the generality of the problem. In order to prove the achievability,
we use the polytope structure of the converse region. In both MAC and IC cases,
we develop explicit schemes that achieve the extreme points of the polytope
region given by the converse. Specifically, the extreme points of the MAC
region are achieved by an m-user MAC wiretap channel with (K-m) helpers, i.e.,
by setting (K-m) users' secure rates to zero and utilizing them as pure
(structured) cooperative jammers. The extreme points of the IC region are
achieved by a (K-m)-user IC with confidential messages, m helpers, and N
external eavesdroppers, for m>=1 and a finite N. A byproduct of our results in
this paper is that the sum s.d.o.f. is achieved only at one extreme point of
the s.d.o.f. region, which is the symmetric-rate extreme point, for both MAC
and IC channel models.Comment: Submitted to IEEE Transactions on Information Theory, April 201
Physical layer security jamming : Theoretical limits and practical designs in wireless networks
Physical layer security has been recently recognized as a promising new
design paradigm to provide security in wireless networks. In addition to the
existing conventional cryptographic methods, physical layer security exploits
the dynamics of fading channels to enhance secured wireless links. In this
approach, jamming plays a key role by generating noise signals to confuse the
potential eavesdroppers, and significantly improves quality and reliability of
secure communications between legitimate terminals. This article presents
theoretical limits and practical designs of jamming approaches for physical
layer security. In particular, the theoretical limits explore the achievable
secrecy rates of user cooperation based jamming whilst the centralized, and
game theoretic based precoding techniques are reviewed for practical
implementations. In addition, the emerging wireless energy harvesting
techniques are exploited to harvest the required energy to transmit jamming
signals. Future directions of these approaches, and the associated research
challenges are also briefly outlined
Physical layer security jamming: Theoretical limits and practical designs in wireless networks
Physical layer security has been recently recognized as a promising new design paradigm to provide security in wireless networks. In addition to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance secured wireless links. In this approach, jamming plays a key role by generating noise signals to confuse the potential eavesdroppers, and significantly improves quality and reliability of secure communications between legitimate terminals. This article presents theoretical limits and practical designs of jamming approaches for physical layer security. In particular, the theoretical limits explore the achievable secrecy rates of user cooperation based jamming whilst the centralized, and game theoretic based precoding techniques are reviewed for practical implementations. In addition, the emerging wireless energy harvesting techniques are exploited to harvest the required energy to transmit jamming signals. Future directions of these approaches, and the associated research challenges are also briefly outlined
Solutions for the MIMO Gaussian Wiretap Channel with a Cooperative Jammer
We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate
receiver, an eavesdropper and an external helper, each equipped with multiple
antennas. The transmitter sends confidential messages to its intended receiver,
while the helper transmits jamming signals independent of the source message to
confuse the eavesdropper. The jamming signal is assumed to be treated as noise
at both the intended receiver and the eavesdropper. We obtain a closed-form
expression for the structure of the artificial noise covariance matrix that
guarantees no decrease in the secrecy capacity of the wiretap channel. We also
describe how to find specific realizations of this covariance matrix expression
that provide good secrecy rate performance, even when there is no non-trivial
null space between the helper and the intended receiver. Unlike prior work, our
approach considers the general MIMO case, and is not restricted to SISO or MISO
scenarios
- …