arXiv subjects

Nicola Laurenti

Publications and source records attributed to Nicola Laurenti.

At least 19 recordsLinked to original sources

arXiv2026

Lightweight Pilot Estimation on LEO Satellite Signals for Enhanced SOP Navigation

The computation of positioning, navigation and timing (PNT) via signal of opportunity (SOP), where signals originally transmitted for communication, such as 5G, Wi-Fi, or DVB-S, are exploited due to their ubiquity and spectral characteristics, is an emerging research field. However, relying on these signals presents challenges, including limited knowledge of the signal modulation and the need to identify recurring sequences for correlation. We offer a guide to implement a receiver capable of capturing broadband downlink Ku-band signals from low Earth orbit (LEO) satellites (e.g., Starlink and OneWeb) and estimating the recurring symbols for SOP measurements. The methodology integrates recent approaches in the literature, highlighting the most effective aspects while guiding the replication of experiments even under limitations on the front-end gain and bandwidth. Using the proposed model, we can identify recurring symbols transmitted by Starlink satellites, which are then used to collect Doppler shift measurements over a 600 s interval. A position, velocity, and time (PVT) solution is also computed via least squares (LS), which achieves a positioning error of approximately 268 m after a post-fit refinement.

eess.SP↗

arXiv2025

Crystal Oscillators in OSNMA-Enabled Receivers: An Implementation View for Automotive Applications

To ensure the authenticity of navigation data, Galileo Open Service navigation message authentication (OSNMA) requires loose synchronization between the receiver clock and the system time. This means that during the period between clock calibrations, the receiver clock error needs to be smaller than a pre-defined threshold, currently up to 165s for OSNMA. On the other hand, relying on the PVT solution to steer the receiver clock or correct its bias may not be possible since this would depend on the very same signals we intend to authenticate. This work aims to investigate the causes of the frequency accuracy loss leading to clock errors and to build a model that, from the datasheet of a real-time clock (RTC) device, allows to bound the error clock during a certain period. The model's main contributors are temperature changes, long-term aging, and offset at calibration, but it includes other factors. We then apply the model to several RTCs from different manufacturers and bound the maximum error for certain periods, with a focus on the two-year between-calibration period expected for the smart tachograph, an automotive application that will integrate OSNMA.

eess.SP↗

arXiv2024

Performance Limits for Signals of Opportunity-Based Navigation

This paper investigates the potential of non-terrestrial and terrestrial signals of opportunity (SOOP) for navigation applications. Non-terrestrial SOOP analysis employs modified Cramèr-Rao lower bound (MCRLB) to establish a relationship between SOOP characteristics and the accuracy of ranging information. This approach evaluates hybrid navigation module performance without direct signal simulation. The MCRLB is computed for ranging accuracy, considering factors like propagation delay, frequency offset, phase offset, and angle-of-arrival (AOA), across diverse non-terrestrial SOOP candidates. Additionally, Geometric Dilution of Precision (GDOP) and low earth orbit (LEO) SOOP availability are assessed. Validation involves comparing MCRLB predictions with actual ranging measurements obtained in a realistic simulated scenario. Furthermore, a qualitative evaluation examines terrestrial SOOP, considering signal availability, accuracy attainability, and infrastructure demands.

eess.SP↗

arXiv2023

The Tree of Light as interstellar optical transmitter system

This work aims at investigating the optical transmission system needed for such lightweight sail, taking into account the physical constraints of such unprecedented link and focusing on the optimal scheme for the optical signal emission. In particular, the optical signal is distributed to several emitters on the sail. The light diffraction resulting from the pattern of the emitters acting coherently determines the characteristics of the whole beam transmitted by the sail and of the received signal on the Earth. The performance of the digital communication system using pulse position modulation (PPM) can be assessed and channel coding schemes are proposed. We are using the paradigm for which the entire sail communication system is described as a Tree-of-light: the detectors, CPU, memory and laser transmitter are the central unit, representing the trunk of the tree. The branches of the tree are the waveguides, directed to the sail surface. By means of multimode splitters, the signal is further distributed via the petioles to the emitters, the leaves, realized by grating couplers (GCs), on which this work is more focused.

astro-ph.IM↗

arXiv2023

It Is Rude to Ask a Sensor Its Age-of-Information: Status Updates Against an Eavesdropping Node

We consider periodical status updates between a transmitter and a legitimate receiver, in the presence of an eavesdropper that is sometimes able to capture pieces of information. We assume that, in the absence of such a threat, the connection between the transmitter and the receiver is controlled by the transmitter with the aim to minimize the age of information at the receiver's side. However, if the presence of an eavesdropper is known, the transmitter may further tune the generation rate of status updates to trade off the age of information values acquired by the eavesdropper and the receiver, respectively. To analyze this problem, we first propose a metric that combines both objectives according to a Bergson social welfare framework, and then we solve the problem of finding the optimal generation rate as a function of the probability of data capture by the eavesdropper. This enables us to derive notable and sometimes counter-intuitive conclusions, and possibly establish an extension of the age of information framework to security aspects from a performance evaluation perspective.

cs.CR↗

arXiv2023

On the Limits of Cross-Authentication Checks for GNSS Signals

Global navigation satellite systems (GNSSs) are implementing security mechanisms: examples are Galileo open service navigation message authentication (OS-NMA) and GPS chips-message robust authentication (CHIMERA). Each of these mechanisms operates in a single band. However, nowadays, even commercial GNSS receivers typically compute the position, velocity, and time (PVT) solution using multiple constellations and signals from multiple bands at once, significantly improving both accuracy and availability. Hence, cross-authentication checks have been proposed, based on the PVT obtained from the mixture of authenticated and non-authenticated signals. In this paper, first, we formalize the models for the cross-authentication checks. Next, we describe, for each check, a spoofing attack to generate a fake signal leading the victim to a target PVT without notice. We analytically relate the degrees of the freedom of the attacker in manipulating the victim's solution to both the employed security checks and the number of open signals that can be tampered with by the attacker. We test the performance of the considered attack strategies on an experimental dataset. Lastly, we show the limits of the PVT-based GNSS cross-authentication checks, where both authenticated and non-authenticated signals are used.

cs.CR↗

arXiv2023

On the Optimal Spoofing Attack and Countermeasure in Satellite Navigation Systems

The threat of signal spoofing attacks against GNSS has grown in recent years and has motivated the study of anti-spoofing techniques. However, defense methods have been designed only against specific attacks. This paper introduces a general model of the spoofing attack framework in GNSS, from which optimal attack and defense strategies are derived. We consider a scenario with a legitimate receiver (Bob) testing if the received signals come from multiple legitimate space vehicles (Alice) or from an attack device (Eve). We first derive the optimal attack strategy against a Gaussian transmission from Alice, by minimizing an outer bound on the achievable error probability region of the spoofing detection test. Then, framing the spoofing and its detection as an adversarial game, we show that the Gaussian transmission and the corresponding optimal attack constitute a Nash equilibrium. Lastly, we consider the case of practical modulation schemes for Alice and derive the generalized likelihood ratio test. Numerical results validate the analytical derivations and show that the bound on the achievable error region is representative of the actual performance.

eess.SP↗

arXiv2021

Information Theoretic Key Agreement Protocol based on ECG signals

Wireless body area networks (WBANs) are becoming increasingly popular as they allow individuals to continuously monitor their vitals and physiological parameters remotely from the hospital. With the spread of the SARS-CoV-2 pandemic, the availability of portable pulse-oximeters and wearable heart rate detectors has boomed in the market. At the same time, in 2020 we assisted to an unprecedented increase of healthcare breaches, revealing the extreme vulnerability of the current generation of WBANs. Therefore, the development of new security protocols to ensure data protection, authentication, integrity and privacy within WBANs are highly needed. Here, we targeted a WBAN collecting ECG signals from different sensor nodes on the individual's body, we extracted the inter-pulse interval (i.e., R-R interval) sequence from each of them, and we developed a new information theoretic key agreement protocol that exploits the inherent randomness of ECG to ensure authentication between sensor pairs within the WBAN. After proper pre-processing, we provide an analytical solution that ensures robust authentication; we provide a unique information reconciliation matrix, which gives good performance for all ECG sensor pairs; and we can show that a relationship between information reconciliation and privacy amplification matrices can be found. Finally, we show the trade-off between the level of security, in terms of key generation rate, and the complexity of the error correction scheme implemented in the system.

cs.CR↗

arXiv2018

Adaptive Real Time Selection for Quantum Key Distribution in Lossy and Turbulent Free-Space Channels

Quantum Key Distribution (QKD) allows to share random keys between two users with unconditional security: the key is usually generated by exchanging a stream of photons. The long-term vision of QKD is represented by a quantum network, implemented by fiber and free-space links involving ground and/or satellites stations. The presence of the atmospheric turbulence represents an obstacle for free-space quantum communications, due to the increase of optical losses. Here we introduce a method to exploit the atmospheric turbulence as a resource for QKD. An Adaptive Real Time Selection (ARTS) technique at the receiver allows to take advantage of the fluctuating transmissivity of the channel, giving rise to an increase of the secure key rate.

quant-ph↗

arXiv2016

Free-space optical channel estimation for physical layer security

We present experimental data on message transmission in a free-space optical (FSO) link at an eye-safe wavelength, using a testbed consisting of one sender and two receiver terminals, where the latter two are a legitimate receiver and an eavesdropper. The testbed allows us to emulate a typical scenario of physical-layer (PHY) security such as satellite-to-ground laser communications. We estimate information-theoretic metrics including secrecy rate, secrecy outage probability, and expected code lengths for given secrecy criteria based on observed channel statistics. We then discuss operation principles of secure message transmission under realistic fading conditions, and provide a guideline on a multi-layer security architecture by combining PHY security and upper-layer (algorithmic) security.

cs.IT↗

arXiv2016

Achievable Secrecy Rates of an Energy Harvesting Device

The secrecy rate represents the amount of information per unit time that can be securely sent on a communication link. In this work, we investigate the achievable secrecy rates in an energy harvesting communication system composed of a transmitter, a receiver and a malicious eavesdropper. In particular, because of the energy constraints and the channel conditions, it is important to understand when a device should transmit and to optimize how much power should be used in order to improve security. Both full knowledge and partial knowledge of the channel are considered under a Nakagami fading scenario. We show that high secrecy rates can be obtained only with power and coding rate adaptation. Moreover, we highlight the importance of optimally dividing the transmission power in the frequency domain, and note that the optimal scheme provides high gains in secrecy rate over the uniform power splitting case. Analytically, we explain how to find the optimal policy and prove some of its properties. In our numerical evaluation, we discuss how the maximum achievable secrecy rate changes according to the various system parameters. Furthermore, we discuss the effects of a finite battery on the system performance and note that, in order to achieve high secrecy rates, it is not necessary to use very large batteries.

cs.IT↗

arXiv2015

Parallel BCC with One Common and Two Confidential Messages and Imperfect CSIT

We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. We assume partial channel state information at the transmitter (CSIT), stemming from noisy channel estimation. The first contribution of this paper is the characterization of the secrecy capacity region boundary as the solution of weighted sum-rate problems, with suitable weights. Partial CSIT is addressed by adding a margin to the estimated channel gains. The second paper contribution is the solution of this problem in an almost closed-form, where only two single real parameters must be optimized, e.g., through dichotomic searches. On the one hand, the considered problem generalizes existing literature where only two out of the three messages are transmitted. On the other hand, the solution finds also practical applications into the resource allocation of orthogonal frequency division multiplexing (OFDM) systems with both secrecy and fairness constraints.

cs.IT↗

arXiv2014

Secrecy Transmission on Block Fading Channels: Theoretical Limits and Performance of Practical Codes

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that Alice perfectly knows the set of channels with respect to Bob, but she has only a statistical knowledge of the channels with respect to Eve. We derive bounds on the achievable outage secrecy rates, by considering coding either within each channel or across all parallel channels. Transmit power is adapted to the channel conditions, with a constraint on the average power over the whole transmission. We also focus on the maximum cumulative outage secrecy rate that can be achieved. Moreover, in order to assess the performance in a real life scenario, we consider the use of practical error correcting codes. We extend the definitions of security gap and equivocation rate, previously applied to the single additive white Gaussian noise channel, to Rayleigh distributed parallel channels, on the basis of the error rate targets and the outage probability. Bounds on these metrics are also derived, taking into account the statistics of the parallel channels. Numerical results are provided, that confirm the feasibility of the considered physical layer security techniques.

cs.IT↗

arXiv2014

Experimental quantum key distribution with finite-key security analysis for noisy channels

In quantum key distribution implementations, each session is typically chosen long enough so that the secret key rate approaches its asymptotic limit. However, this choice may be constrained by the physical scenario, as in the perspective use with satellites, where the passage of one terminal over the other is restricted to a few minutes. Here we demonstrate experimentally the extraction of secure keys leveraging an optimal design of the prepare-and-measure scheme, according to recent finite-key theoretical tight-bounds. The experiment is performed in different channel conditions, and assuming two distinct attack models: individual attacks, or general quantum attacks. The request on the number of exchanged qubits is then obtained as a function of the key size and of the ambient quantum bit error rate. The results indicate that viable conditions for effective symmetric, and even one-time-pad, cryptography are achievable.

quant-ph↗

arXiv2014

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.

cs.IT↗

arXiv2014

Achievable Secrecy Rates over MIMOME Gaussian Channels with GMM Signals in Low-Noise Regime

We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume that Alice has more antennas than both Bob and Eve, and that she has only statistical knowledge of the channel towards Eve. We focus on the low-noise regime, and assess the secrecy rates that are achievable when the secret message determines the distribution of a multivariate Gaussian mixture model (GMM) from which a realization is generated and transmitted over the channel. In particular, we show that if Eve has fewer antennas than Bob, secret transmission is always possible at low-noise. Moreover, we show that in the low-noise limit the secrecy capacity of our scheme coincides with its unconstrained capacity, by providing a class of covariance matrices that allow to attain such limit without the need of wiretap coding.

cs.IT↗

arXiv2014

Secret Message Transmission by HARQ with Multiple Encoding

Secure transmission between two agents, Alice and Bob, over block fading channels can be achieved similarly to conventional hybrid automatic repeat request (HARQ) by letting Alice transmit multiple blocks, each containing an encoded version of the secret message, until Bob informs Alice about successful decoding by a public error-free return channel. In existing literature each block is a differently punctured version of a single codeword generated with a Wyner code that uses a common randomness for all blocks. In this paper instead we propose a more general approach where multiple codewords are generated from independent randomnesses. The class of channels for which decodability and secrecy is ensured is characterized, with derivations for the existence of secret codes. We show in particular that the classes are not a trivial subset (or superset) of those of existing schemes, thus highlighting the novelty of the proposed solution. The result is further confirmed by deriving the average achievable secrecy throughput, thus taking into account both decoding and secrecy outage.

cs.CR↗

arXiv2014

Optimal Binary Codes and Measurements for Classical Communication over Qubit Channels

We propose constructive approaches for the optimization of binary classical communication over a general noisy qubit quantum channel, for both the error probability and the classical capacity functionals. After showing that the optimal measurements are always associated to orthogonal projections, we construct a parametrization of the achievable transition probabilities via the coherence vector representation. We are then able to rewrite the problem in a form that can be solved by standard, efficient numerical algorithms and provides insights on the form of the solutions.

quant-ph↗