Related papers: Group secret key agreement over state-dependent wi…
We consider wireless sensor networks secured by the heterogeneous random key predistribution scheme under an on/off channel model. The heterogeneous random key predistribution scheme considers the case when the network includes sensor nodes…
Security against eavesdropping is one of the key concerns in the design of any communication system. Many common considerations of the security of a wireless communication channel rely on comparing the signal level measured by Bob (the…
We provide a simple method to obtain an upper bound on the secret key rate that is particularly suited to analyze practical realizations of quantum key distribution protocols with imperfect devices. We consider the so-called trusted device…
In this paper, we investigate power allocation that maximizes the secrecy rate of orthogonal frequency division multiplexing (OFDM) systems under arbitrarily distributed inputs. Considering commonly assumed Gaussian inputs are unrealistic,…
A dealer aims to share a secret with participants so that only predefined subsets can reconstruct it, while others learn nothing. The dealer and participants access correlated randomness and communicate over a one-way, public, rate-limited…
Secure communication over a memoryless wiretap channel in the presence of a passive eavesdropper is considered. Traditional information-theoretic security methods require an advantage for the main channel over the eavesdropper channel to…
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…
In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the…
We propose and analyze secret key generation using intelligent reflecting surface (IRS) assisted wireless communication networks. To this end, we first formulate the minimum achievable secret key capacity for an IRS acting as a passive…
In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel…
This work considers secure transmission protocol for flexible load-balance control in two-hop relay wireless networks without the information of both eavesdropper channels and locations. The available secure transmission protocols via relay…
This paper addresses the establishment of secure communication links between smart-meters (Alice) and an aggregator (Bob) in the presence of an eavesdropper (Eve). The proposed scenario assumes: (i) MIMOME wiretap channel; (ii) transmit…
Generating keys and keeping them secret is critical in secure communications. Due to the "open-air" nature, key distribution is more susceptible to attacks in wireless communications. An ingenious solution is to generate common secret keys…
This paper suggests an improvement to the BB84 scheme in Quantum key distribution. The original scheme has its weakness in letting quantifiably more information gain to an eavesdropper during public announcement of unencrypted bases lists.…
A quantum key distribution network enables pairs of users to generate independent secret keys by leveraging the principles of quantum physics. For end-to-end secure communication, a user pair's secret key must remain secure against any…
For a discrete or a continuous source model, we study the problem of secret-key generation with one round of rate-limited public communication between two legitimate users. Although we do not provide new bounds on the wiretap secret-key…
We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…
A novel framework for sharing common randomness and generating secret keys in wireless networks is considered. In particular, a network of users equipped with pulse oscillators (POs) and coupling mechanisms in between is considered. Such…
We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one,…
We consider secrecy obtained when one transmits on a Gaussian Wiretap channel above the secrecy capacity. Instead of equivocation, we consider probability of error as the criterion of secrecy. The usual channel codes are considered for…