85 research outputs found
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
Almost universal codes for fading wiretap channels
We consider a fading wiretap channel model where the transmitter has only
statistical channel state information, and the legitimate receiver and
eavesdropper have perfect channel state information. We propose a sequence of
non-random lattice codes which achieve strong secrecy and semantic security
over ergodic fading channels. The construction is almost universal in the sense
that it achieves the same constant gap to secrecy capacity over Gaussian and
ergodic fading models.Comment: 5 pages, to be submitted to IEEE International Symposium on
Information Theory (ISIT) 201
An Error Probability Approach to MIMO Wiretap Channels
We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a
legitimate transmitter Alice is communicating with a legitimate receiver Bob in
the presence of an eavesdropper Eve, and communication is done via MIMO
channels. We suppose that Alice's strategy is to use a codebook which has a
lattice structure, which then allows her to perform coset encoding. We analyze
Eve's probability of correctly decoding the message Alice meant to Bob, and
from minimizing this probability, we derive a code design criterion for MIMO
lattice wiretap codes. The case of block fading channels is treated similarly,
and fast fading channels are derived as a particular case. The Alamouti code is
carefully studied as an illustration of the analysis provided.Comment: 27 pages, 4 figure
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions
In this paper, new probability bounds are derived for algebraic lattice
codes. This is done by using the Dedekind zeta functions of the algebraic
number fields involved in the lattice constructions. In particular, it is shown
how to upper bound the error performance of a finite constellation on a
Rayleigh fading channel and the probability of an eavesdropper's correct
decision in a wiretap channel. As a byproduct, an estimate of the number of
elements with a certain algebraic norm within a finite hyper-cube is derived.
While this type of estimates have been, to some extent, considered in algebraic
number theory before, they are now brought into novel practice in the context
of fading channel communications. Hence, the interest here is in
small-dimensional lattices and finite constellations rather than in the
asymptotic behavior
Probability Estimates for Fading and Wiretap Channels from Ideal Class Zeta Functions
In this paper, new probability estimates are derived for ideal lattice codes
from totally real number fields using ideal class Dedekind zeta functions. In
contrast to previous work on the subject, it is not assumed that the ideal in
question is principal. In particular, it is shown that the corresponding
inverse norm sum depends not only on the regulator and discriminant of the
number field, but also on the values of the ideal class Dedekind zeta
functions. Along the way, we derive an estimate of the number of elements in a
given ideal with a certain algebraic norm within a finite hypercube. We provide
several examples which measure the accuracy and predictive ability of our
theorems.Comment: 24 pages. Extends our earlier arxiv submission arxiv.1303.347
- …