In a wide band and multipath rich environment, precise channel estimation allows authenticating the source and protecting the integrity of a message at the physical layer without the need of a pre-shared secret key. This allows also a reduction of the burden on the authentication protocols at higher layers. In this paper we develop an authentication scheme in the framework of hypothesis testing that suits a multiple wiretap channels environment with correlated fading, as is the case of multiple input multiple output (MIMO) systems and/or orthogonal frequency division multiplexing (OFDM) modulation. By allowing some degree of correlation among the channels, we formulate the optimal attack strategy for the cases of both single attempt and multiple repeated trials. For the latter scenario, due to the complexity of the optimal solution, we also develop a simpler suboptimal attack strategy. The performance of the proposed methods is evaluated in a MIMO/OFDM scenario and numerical results show the merits of the proposed approaches that can be adopted as a layer one authentication mechanism

We study through analysis the joint effect of time offsets, frequency offsets, and multi-path

This paper considers the information theoretic secrecy rates that are achievable by an orthogonal frequency-division multiplexing (OFDM) transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is made possible by modeling the system as a particular instance of a high dimensional multiple-input multiple-output wiretap channel. The secrecy capacity is formulated as a maximization problem under a trace constraint, and simple expressions are given for its high signal-to-noise (SNR) limit. The low rate limit of the secrecy outage probability is also evaluated under a fading channel model. As for the finite SNR case, the secrecy rates that can be achieved with particular inputs are considered. Numerical results are provided under a Rayleigh fading channel model and under dependence of the main and eavesdropper channels. The secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses amore complex receiver, are also considered

No abstract

The unconditional security in the creation of cryptographic keys obtained by quantum key distribution (QKD) protocols will induce a quantum leap in free-space communication privacy in the same way that we are beginning to realize secure optical fiber connections. However, free-space channels, in particular those with long links and the presence of atmospheric turbulence, are affected by losses, fluctuating transmissivity, and background light that impair the conditions for secure QKD. Here we introduce a method to contrast the atmospheric turbulence in QKD experiments. Our adaptive real time selection (ARTS) technique at the receiver is based on the selection of the intervals with higher channel transmissivity. We demonstrate, using data from the Canary Island 143-km free-space link, that conditions with unacceptable average quantum bit error rate which would prevent the generation of a secure key can be used once parsed according to the instantaneous scintillation using the ARTS technique

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-andmeasure 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.

The paper investigates the possibility for giving a general definition of the fractional Fourier transform (FRT) for all signal classes [one-dimensional (1-D) and multidimensional, continuous and discrete, periodic and aperiodic]. Since the definition is based on the eigenfunctions of the ordinary Fourier transform (FT), the preliminary conditions is that the signal domain/periodicity be the same as the FT domain/periodicity. Within these classes, a general FRT definition is formulated, and the FRT properties are established. In addition, the multiplicity (which is intrinsic in a fractional operator) is clearly developed. The general definition is checked in the case in which the FRT is presently available and, moreover, to establish the FRT in new classes of signals

No abstract