19,216 research outputs found
On the Achievable Error Region of Physical Layer Authentication Techniques over Rayleigh Fading Channels
For a physical layer message authentication procedure based on the comparison
of channel estimates obtained from the received messages, we focus on an outer
bound on the type I/II error probability region. Channel estimates are modelled
as multivariate Gaussian vectors, and we assume that the attacker has only some
side information on the channel estimate, which he does not know directly. We
derive the attacking strategy that provides the tightest bound on the error
region, given the statistics of the side information. This turns out to be a
zero mean, circularly symmetric Gaussian density whose correlation matrices may
be obtained by solving a constrained optimization problem. We propose an
iterative algorithm for its solution: Starting from the closed form solution of
a relaxed problem, we obtain, by projection, an initial feasible solution;
then, by an iterative procedure, we look for the fixed point solution of the
problem. Numerical results show that for cases of interest the iterative
approach converges, and perturbation analysis shows that the found solution is
a local minimum
Cooperative Authentication in Underwater Acoustic Sensor Networks
With the growing use of underwater acoustic communications (UWAC) for both
industrial and military operations, there is a need to ensure communication
security. A particular challenge is represented by underwater acoustic networks
(UWANs), which are often left unattended over long periods of time. Currently,
due to physical and performance limitations, UWAC packets rarely include
encryption, leaving the UWAN exposed to external attacks faking legitimate
messages. In this paper, we propose a new algorithm for message authentication
in a UWAN setting. We begin by observing that, due to the strong spatial
dependency of the underwater acoustic channel, an attacker can attempt to mimic
the channel associated with the legitimate transmitter only for a small set of
receivers, typically just for a single one. Taking this into account, our
scheme relies on trusted nodes that independently help a sink node in the
authentication process. For each incoming packet, the sink fuses beliefs
evaluated by the trusted nodes to reach an authentication decision. These
beliefs are based on estimated statistical channel parameters, chosen to be the
most sensitive to the transmitter-receiver displacement. Our simulation results
show accurate identification of an attacker's packet. We also report results
from a sea experiment demonstrating the effectiveness of our approach.Comment: Author version of paper accepted for publication in the IEEE
Transactions on Wireless Communication
Channel Impulse Response-based Distributed Physical Layer Authentication
In this preliminary work, we study the problem of {\it distributed}
authentication in wireless networks. Specifically, we consider a system where
multiple Bob (sensor) nodes listen to a channel and report their {\it
correlated} measurements to a Fusion Center (FC) which makes the ultimate
authentication decision. For the feature-based authentication at the FC,
channel impulse response has been utilized as the device fingerprint.
Additionally, the {\it correlated} measurements by the Bob nodes allow us to
invoke Compressed sensing to significantly reduce the reporting overhead to the
FC. Numerical results show that: i) the detection performance of the FC is
superior to that of a single Bob-node, ii) compressed sensing leads to at least
overhead reduction on the reporting channel at the expense of a small
( dB) SNR margin to achieve the same detection performance.Comment: 6 pages, 5 figures, accepted for presentation at IEEE VTC 2017 Sprin
Distributed Binary Detection with Lossy Data Compression
Consider the problem where a statistician in a two-node system receives
rate-limited information from a transmitter about marginal observations of a
memoryless process generated from two possible distributions. Using its own
observations, this receiver is required to first identify the legitimacy of its
sender by declaring the joint distribution of the process, and then depending
on such authentication it generates the adequate reconstruction of the
observations satisfying an average per-letter distortion. The performance of
this setup is investigated through the corresponding rate-error-distortion
region describing the trade-off between: the communication rate, the error
exponent induced by the detection and the distortion incurred by the source
reconstruction. In the special case of testing against independence, where the
alternative hypothesis implies that the sources are independent, the optimal
rate-error-distortion region is characterized. An application example to binary
symmetric sources is given subsequently and the explicit expression for the
rate-error-distortion region is provided as well. The case of "general
hypotheses" is also investigated. A new achievable rate-error-distortion region
is derived based on the use of non-asymptotic binning, improving the quality of
communicated descriptions. Further improvement of performance in the general
case is shown to be possible when the requirement of source reconstruction is
relaxed, which stands in contrast to the case of general hypotheses.Comment: to appear on IEEE Trans. Information Theor
- …