3,629 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
On the Design of Artificial-Noise-Aided Secure Multi-Antenna Transmission in Slow Fading Channels
In this paper, we investigate the design of artificial-noise-aided secure
multi-antenna transmission in slow fading channels. The primary design concerns
include the transmit power allocation and the rate parameters of the wiretap
code. We consider two scenarios with different complexity levels: i) the design
parameters are chosen to be fixed for all transmissions, ii) they are
adaptively adjusted based on the instantaneous channel feedback from the
intended receiver. In both scenarios, we provide explicit design solutions for
achieving the maximal throughput subject to a secrecy constraint, given by a
maximum allowable secrecy outage probability. We then derive accurate
approximations for the maximal throughput in both scenarios in the high
signal-to-noise ratio region, and give new insights into the additional power
cost for achieving a higher security level, whilst maintaining a specified
target throughput. In the end, the throughput gain of adaptive transmission
over non-adaptive transmission is also quantified and analyzed.Comment: to appear in IEEE Transactions on Vehicular Technolog
Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward
We investigate the problem of secure communications in a Gaussian multi-way
relay channel applying the compute-and-forward scheme using nested lattice
codes. All nodes employ half-duplex operation and can exchange confidential
messages only via an untrusted relay. The relay is assumed to be honest but
curious, i.e., an eavesdropper that conforms to the system rules and applies
the intended relaying scheme. We start with the general case of the
single-input multiple-output (SIMO) L-user multi-way relay channel and provide
an achievable secrecy rate region under a weak secrecy criterion. We show that
the securely achievable sum rate is equivalent to the difference between the
computation rate and the multiple access channel (MAC) capacity. Particularly,
we show that all nodes must encode their messages such that the common
computation rate tuple falls outside the MAC capacity region of the relay. We
provide results for the single-input single-output (SISO) and the
multiple-input single-input (MISO) L-user multi-way relay channel as well as
the two-way relay channel. We discuss these results and show the dependency
between channel realization and achievable secrecy rate. We further compare our
result to available results in the literature for different schemes and show
that the proposed scheme operates close to the compute-and-forward rate without
secrecy.Comment: submitted to JSAC Special Issue on Fundamental Approaches to Network
Coding in Wireless Communication System
A Survey of Physical Layer Security Techniques for 5G Wireless Networks and Challenges Ahead
Physical layer security which safeguards data confidentiality based on the
information-theoretic approaches has received significant research interest
recently. The key idea behind physical layer security is to utilize the
intrinsic randomness of the transmission channel to guarantee the security in
physical layer. The evolution towards 5G wireless communications poses new
challenges for physical layer security research. This paper provides a latest
survey of the physical layer security research on various promising 5G
technologies, including physical layer security coding, massive multiple-input
multiple-output, millimeter wave communications, heterogeneous networks,
non-orthogonal multiple access, full duplex technology, etc. Technical
challenges which remain unresolved at the time of writing are summarized and
the future trends of physical layer security in 5G and beyond are discussed.Comment: To appear in IEEE Journal on Selected Areas in Communication
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
Semantically Secure Lattice Codes for Compound MIMO Channels
We consider compound multi-input multi-output (MIMO) wiretap channels where
minimal channel state information at the transmitter (CSIT) is assumed. Code
construction is given for the special case of isotropic mutual information,
which serves as a conservative strategy for general cases. Using the flatness
factor for MIMO channels, we propose lattice codes universally achieving the
secrecy capacity of compound MIMO wiretap channels up to a constant gap
(measured in nats) that is equal to the number of transmit antennas. The
proposed approach improves upon existing works on secrecy coding for MIMO
wiretap channels from an error probability perspective, and establishes
information theoretic security (in fact semantic security). We also give an
algebraic construction to reduce the code design complexity, as well as the
decoding complexity of the legitimate receiver. Thanks to the algebraic
structures of number fields and division algebras, our code construction for
compound MIMO wiretap channels can be reduced to that for Gaussian wiretap
channels, up to some additional gap to secrecy capacity.Comment: IEEE Trans. Information Theory, to appea
- …