Related papers: Secret Key Generation Via Localization and Mobilit…
This paper establishes the fundamental limits of a multi-access system where multiple users communicate to a legitimate receiver in presence of an external warden. Only a specific subset of the users, called covert users, needs their…
This paper uses Euclidean Information Theory (EIT) to analyze the wiretap channel. We investigate a scenario of efficiently transmitting a small amount of information subject to compression rate and secrecy constraints. We transform the…
In this paper we extend the notion of {\em locally repairable} codes to {\em secret sharing} schemes. The main problem that we consider is to find optimal ways to distribute shares of a secret among a set of storage-nodes (participants)…
Quantum secret sharing (QSS) enables a dealer to securely distribute keys to multiple players. Device-independent (DI) QSS can resist all possible attacks from practical imperfect devices and provide QSS the highest level of security in…
Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on…
Device-independent quantum key distribution is a secure quantum cryptographic paradigm that allows two honest users to establish a secret key, while putting minimal trust in their devices. Most of the existing protocols have the following…
We have developed a method to calculate a secret key rate of a continuous-variable quantum-key-distribution scheme using four coherent states and postselection for a general model of Gaussian attacks. We assume that the transmission line…
In the problem of location anonymity of the events exposed to a global eavesdropper, we highlight and analyze some aspects that are missing in the prior work, which is especially relevant for the quality of secure sensing in…
We consider in this paper the information-theoretic secure key distribution problem over main and wire-tap noise channels with a public discussion in presence of an active adversary. In contrast to the solution proposed by ourselves for a…
This article presents a secure key exchange algorithm that exploits reciprocity in wireless channels to share a secret key between two nodes $A$ and $B$. Reciprocity implies that the channel phases in the links $A\rightarrow B$ and…
The fundamental security and efficiency considerations for fresh key generation will be described. It is shown that the attacker's optimal probability of finding the generated key is an indispensable measure of security and that this…
We investigate the possibility of eavesdropping on a quantum key distribution network by local sequential quantum unsharp measurement attacks by the eavesdropper. In particular, we consider a pure two-qubit state shared between two parties…
This work shows how two parties A and B can securely share sequences of random bits at optical speeds. A and B possess true-random physical sources and exchange random bits by using a random sequence received to cipher the following one to…
In this paper, we consider the use of artificial noise for secure communications. We propose the notion of practical secrecy as a new design criterion based on the behavior of the eavesdropper's error probability $P_E$, as the…
In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent…
We investigate two source coding problems with secrecy constraints. In the first problem we consider real--time fully secure transmission of a memoryless source. We show that although classical variable--rate coding is not an option since…
We propose a method to study the secrecy constraints in key generation problems where side information might be present at untrusted users. Our method is inspired by a recent work of Hayashi and Tan who used the R\'enyi divergence as the…
The security of wireless sensor networks is an active topic of research where both symmetric and asymmetric key cryptography issues have been studied. Due to their computational feasibility on typical sensor nodes, symmetric key algorithms…
This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…
We propose a novel physical layer secret key generation method for the inter-spacecraft communication links. By exploiting the Doppler frequency shifts of the reciprocal spacecraft links as a unique secrecy source, spacecrafts aim to obtain…