9,053 research outputs found
On Enhancements of Physical Layer Secret Key Generation and Its Application in Wireless Communication Systems
As an alternative and appealing approach to providing information security in wireless communication systems, secret key generation at physical layer has demonstrated its potential in terms of efficiency and reliability over traditional cryptographic methods. Without the necessity of a management centre for key distribution or reliance on computational complexity, physical layer key generation protocols enable two wireless entities to extract identical and dynamic keys from the randomness of the wireless channels associated with them.
In this thesis, the reliability of secret key generation at the physical layer is examined in practical wireless channels with imperfect channel state information (CSI). Theoretical analyses are provided to relate key match rate with channel\u27s signal-to-noise ratio (SNR), degrees of channel reciprocity, and iterations of information reconciliation.
In order to increase key match rate of physical layer secret key generation, improved schemes in the steps of channel estimation and sample quantization are proposed respectively. In the channel estimation step, multiple observations of the wireless channels are integrated with a linear processor to provide a synthesized and more accurate estimation of the wireless channel. In the sample quantization step, a magnitude based quantization method with two thresholds is proposed to quantize partial samples, where specific quantization areas are selected to reduce cross-over errors. Significant improvements in key match rate are proven for both schemes in theoretical analysis and numerical simulations. Key match rate can even achieve 100% in both schemes with the assistance of information reconciliation process.
In the end, a practical application of physical layer secret key generation is presented, where dynamic keys extracted from the wireless channels are utilized for securing secret data transmission and providing efficient access control
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the Ď„-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the Ď„-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
Secure Massive MIMO Communication with Low-resolution DACs
In this paper, we investigate secure transmission in a massive multiple-input
multiple-output (MIMO) system adopting low-resolution digital-to-analog
converters (DACs). Artificial noise (AN) is deliberately transmitted
simultaneously with the confidential signals to degrade the eavesdropper's
channel quality. By applying the Bussgang theorem, a DAC quantization model is
developed which facilitates the analysis of the asymptotic achievable secrecy
rate. Interestingly, for a fixed power allocation factor , low-resolution
DACs typically result in a secrecy rate loss, but in certain cases they provide
superior performance, e.g., at low signal-to-noise ratio (SNR). Specifically,
we derive a closed-form SNR threshold which determines whether low-resolution
or high-resolution DACs are preferable for improving the secrecy rate.
Furthermore, a closed-form expression for the optimal is derived. With
AN generated in the null-space of the user channel and the optimal ,
low-resolution DACs inevitably cause secrecy rate loss. On the other hand, for
random AN with the optimal , the secrecy rate is hardly affected by the
DAC resolution because the negative impact of the quantization noise can be
compensated for by reducing the AN power. All the derived analytical results
are verified by numerical simulations.Comment: 14 pages, 10 figure
Authentication of Satellite Navigation Signals by Wiretap Coding and Artificial Noise
In order to combat the spoofing of global navigation satellite system (GNSS)
signals we propose a novel approach for satellite signal authentication based
on information-theoretic security. In particular we superimpose to the
navigation signal an authentication signal containing a secret message
corrupted by artificial noise (AN), still transmitted by the satellite. We
impose the following properties: a) the authentication signal is synchronous
with the navigation signal, b) the authentication signal is orthogonal to the
navigation signal and c) the secret message is undecodable by the attacker due
to the presence of the AN. The legitimate receiver synchronizes with the
navigation signal and stores the samples of the authentication signal with the
same synchronization. After the transmission of the authentication signal,
through a separate public asynchronous authenticated channel (e.g., a secure
Internet connection) additional information is made public allowing the
receiver to a) decode the secret message, thus overcoming the effects of AN,
and b) verify the secret message. We assess the performance of the proposed
scheme by the analysis of both the secrecy capacity of the authentication
message and the attack success probability, under various attack scenarios. A
comparison with existing approaches shows the effectiveness of the proposed
scheme
Artificial-Noise-Aided Secure Multi-Antenna Transmission with Limited Feedback
We present an optimized secure multi-antenna transmission approach based on
artificial-noise-aided beamforming, with limited feedback from a desired
single-antenna receiver. To deal with beamformer quantization errors as well as
unknown eavesdropper channel characteristics, our approach is aimed at
maximizing throughput under dual performance constraints - a connection outage
constraint on the desired communication channel and a secrecy outage constraint
to guard against eavesdropping. We propose an adaptive transmission strategy
that judiciously selects the wiretap coding parameters, as well as the power
allocation between the artificial noise and the information signal. This
optimized solution reveals several important differences with respect to
solutions designed previously under the assumption of perfect feedback. We also
investigate the problem of how to most efficiently utilize the feedback bits.
The simulation results indicate that a good design strategy is to use
approximately 20% of these bits to quantize the channel gain information, with
the remainder to quantize the channel direction, and this allocation is largely
insensitive to the secrecy outage constraint imposed. In addition, we find that
8 feedback bits per transmit antenna is sufficient to achieve approximately 90%
of the throughput attainable with perfect feedback.Comment: to appear in IEEE Transactions on Wireless Communication
Analysis of Channel-Based User Authentication by Key-Less and Key-Based Approaches
User authentication (UA) supports the receiver in deciding whether a message
comes from the claimed transmitter or from an impersonating attacker. In
cryptographic approaches messages are signed with either an asymmetric or
symmetric key, and a source of randomness is required to generate the key. In
physical layer authentication (PLA) instead the receiver checks if received
messages presumably coming from the same source undergo the same channel. We
compare these solutions by considering the physical-layer channel features as
randomness source for generating the key, thus allowing an immediate comparison
with PLA (that already uses these features). For the symmetric-key approach we
use secret key agreement, while for asymmetric-key the channel is used as
entropy source at the transmitter. We focus on the asymptotic case of an
infinite number of independent and identically distributed channel
realizations, showing the correctness of all schemes and analyzing the secure
authentication rate, that dictates the rate at which the probability that UA
security is broken goes to zero as the number of used channel resources (to
generate the key or for PLA) goes to infinity. Both passive and active attacks
are considered and by numerical results we compare the various systems
Fronthaul Quantization as Artificial Noise for Enhanced Secret Communication in C-RAN
This work considers the downlink of a cloud radio access network (C-RAN), in
which a control unit (CU) encodes confidential messages, each of which is
intended for a user equipment (UE) and is to be kept secret from all the other
UEs. As per the C-RAN architecture, the encoded baseband signals are quantized
and compressed prior to the transfer to distributed radio units (RUs) that are
connected to the CU via finite-capacity fronthaul links. This work argues that
the quantization noise introduced by fronthaul quantization can be leveraged to
act as "artificial" noise in order to enhance the rates achievable under
secrecy constraints. To this end, it is proposed to control the statistics of
the quantization noise by applying multivariate, or joint, fronthaul
quantization/compression at the CU across all outgoing fronthaul links.
Assuming wiretap coding, the problem of jointly optimizing the precoding and
multivariate compression strategies, along with the covariance matrices of
artificial noise signals generated by RUs, is formulated with the goal of
maximizing the weighted sum of achievable secrecy rates while satisfying per-RU
fronthaul capacity and power constraints. After showing that the artificial
noise covariance matrices can be set to zero without loss of optimaliy, an
iterative optimization algorithm is derived based on the concave convex
procedure (CCCP), and some numerical results are provided to highlight the
advantages of leveraging quantization noise as artificial noise.Comment: to appear in Proc. IEEE SPAWC 201
- …