Related papers: Fundamental Limits of Covert Packet Insertion
A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive…
Covert communication aims to hide the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, we examine the possibility and achievable performance of covert communication in…
Inspired from quantum key distribution, we consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise…
Quantum Key Distribution allows two parties to establish a secret key that is secure against computationally unbounded adversaries. To extend the distance between parties, quantum networks, and in particular repeater chains, are vital.…
The task of privacy amplification, in which Alice holds some partially secret information with respect to an adversary Eve and wishes to distill it until it is completely secret, is known to be solvable almost optimally both in the…
We illustrate using a quantum system the principle of a cryptographic switch, in which a third party (Charlie) can control to a continuously varying degree the amount of information the receiver (Bob) receives, after the sender (Alice) has…
A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…
This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same…
In this work we revisit the Boolean Hidden Matching communication problem, which was the first communication problem in the one-way model to demonstrate an exponential classical-quantum communication separation. In this problem, Alice's…
In order to communicate a message over a noisy channel, a sender (Alice) uses an error-correcting code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever there is at most a small constant fraction of…
Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state $\rho_{ABE}$, such that Alice possesses the $A$ systems and Bob…
We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We…
Wireless covert channels promise to exfiltrate information with high bandwidth by circumventing traditional access control mechanisms. Ideally, they are only accessible by the intended recipient and---for regular system…
Several simple yet secure protocols to authenticate the quantum channel of various QKD schemes, by coupling the photon sender's knowledge of a shared secret and the QBER Bob observes, are presented. It is shown that Alice can encrypt…
We propose a communication protocol exploiting correlations between two events with a definite time-ordering: a) the outcome of a {\em weak measurement} on a spin, and b) the outcome of a subsequent ordinary measurement on the spin. In our…
The flexibility and complexity of IPv6 extension headers allow attackers to create covert channels or bypass security mechanisms, leading to potential data breaches or system compromises. The mature development of machine learning has…
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…
We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…
We study a backscatter communication protocol over a AWGN channel, where a transmitter illuminates a tag with a directional multi-antenna. The tag performs load modulation on the signal while hiding its physical presence from a warden. We…
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…