Related papers: Covert, Low-Delay, Coded Message Passing in Mobile…
Multiparty quantum communication is an important branch of quantum networks. It enables private information transmission with information-theoretic security among legitimate parties. We propose a sender-controlled…
We study an extension of the standard two-party communication model in which Alice and Bob hold probability distributions $p$ and $q$ over domains $X$ and $Y$, respectively. Their goal is to estimate \[ \mathbb{E}_{x \sim p,\, y \sim…
We propose a teleportation protocol involving beam splitting operations and binary-outcome measurements, such as parity measurements. These operations have a straightforward implementation using the dispersive regime of the Jaynes-Cummings…
We propose a multiple pulses phase-matching quantum key distribution protocol (MPPM-QKD) to exceed the linear key rate bound and to achieve higher error tolerance. In our protocol, Alice and Bob generate at first their own train pulses…
This paper investigates the problem of covert communications in a heterogeneous wireless network where multiple communication modalities are used simultaneously. In this setup, a legitimate transmitter sends confidential data to its…
We propose an information transmission scheme by a swarm of anonymous oblivious mobile robots on a graph. The swarm of robots travel from a sender vertex to a receiver vertex to transmit a symbol generated at the sender. The codeword for a…
We investigate ways for the exchange of information (explicit communication) among deaf and dumb mobile robots scattered in the plane. We introduce the use of movement-signals (analogously to flight signals and bees waggle) as a mean to…
Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information.…
We consider the problem of computing a $(1+\epsilon)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this…
Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…
This paper investigates the physical-layer security for a random indoor visible light communication (VLC) network with imperfect channel state information (CSI) and a protected zone. The VLC network consists of three nodes, i.e., a…
Content-centric mobile hybrid Internet-of-Things (IoT) networks consisting of mobile devices and static femto access points (FAPs) are studied, where each device moves according to the random walk mobility model and requests a content…
If both Alice and Bob have access to a two-qubit "background state" then, by simulating Everett's many worlds interpretation of measurement, Alice can teleport a qubit to Bob, each using fixed unitaries. The Everett picture unifies…
The `no communication' theorem prohibits superluminal communication by showing that any measurement by Alice on an entangled system cannot change the reduced density matrix of Bob's state, and hence the expectation value of any measurement…
This paper considers a scenario in which an Alice-Bob pair wishes to communicate in secret in the presence of an active Eve, who is capable of jamming as well as eavesdropping in Full-Duplex (FD) mode. As countermeasure, Bob also operates…
Onion routing is the most widely used approach to anonymous communication online. The idea is that Alice wraps her message to Bob in layers of encryption to form an "onion," and routes it through a series of intermediaries. Each…
A generalized teleportation protocol (GTP) for N qubits is presented, where the teleportation channels are non-maximally entangled and all the free parameters of the protocol are considered: Alice's measurement basis, her sets of acceptable…
We show that in the document exchange problem, where Alice holds $x \in \{0,1\}^n$ and Bob holds $y \in \{0,1\}^n$, Alice can send Bob a message of size $O(K(\log^2 K+\log n))$ bits such that Bob can recover $x$ using the message and his…
We present a bidirectional modification of the standard one-qubit teleportation protocol, where both Alice and Bob transfer noisy versions of their qubit states to each other by using single Bell state and auxiliary (trigger) qubits. Three…
We introduce a communication model called universal SMP, in which Alice and Bob receive a function $f$ belonging to a family $\mathcal{F}$, and inputs $x$ and $y$. Alice and Bob use shared randomness to send a message to a third party who…