Related papers: On Ping-Pong protocol and its variant
In this paper we propose a two-way protocol of physical layer security using the method of privacy amplification against eavesdroppers. First we justify our proposed protocol by analyzing the physical layer security provided by the classic…
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably…
In a Letter, Cabello proposed a quantum key distribution (QKD) Protocol which attended to Holevo limit. In this comment, we show that Eve could use a simple plan to distinguish among quantum keys, without being detected by Alice and Bob. In…
A quantum protocol for sharing an arbitrary two-qubit state between N parties is introduced. Any of the members, can retrieve the state, only with collaboration of the other parties. We will show that in terms of resources, i.e. the number…
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…
The need of discriminating between different quantum states is a fundamental issue in Quantum Information and Communication. The actual realization of generally optimal strategies in this task is often limited by the need of supplemental…
We consider the problem of teleporting an unknown information state within a quantum network by a sender, say, Alice to any given receiver out of several receivers, say, Bob(1), Bob(2), ...., Bob(n). For this task, we suggest two schemes…
We consider the possibilities offered by Gaussian states and operations for two honest parties, Alice and Bob, to obtain privacy against a third eavesdropping party, Eve. We first extend the security analysis of the protocol proposed in M.…
We analyse Ping-Pong protocol from the point of view of a game. The analysis helps us in understanding the different strategies of a sender and an eavesdropper to gain the maximum payoff in the game. The study presented here characterizes…
Anyons have been extensively investigated as information carriers in topological quantum computation. However, how to characterize the information flow in quantum networks composed of anyons is less understood, which motivates us to study…
A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening…
We study general teleportation scheme with an arbitrary state of the pair of particles (2 and 3) shared by Alice and Bob, and arbitrary measurements on the input particle 1 and one of the members (2) of the pair on Alice's side. We find an…
A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, $\cal E$, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is…
We present a quantum secure direct communication scheme achieved by swapping quantum entanglement. In this scheme a set of ordered Einstein-Podolsky-Rosen (EPR) pairs is used as a quantum information channel for sending secret messages…
The eavesdropping scheme proposed by W\'{o}jcik [Phys. Rev. Lett. {\bf 90},157901(2003)] on the quantum communication protocol of Bostr\"{o}m and Felbinger [Phys. Rev. Lett. {\bf 89}, 187902(2002)] is improved by constituting a new set of…
Quantum teleportation has become a fundamental building block of quantum technologies, playing a vital role in the development of quantum communication networks. Here, we present a bidirectional quantum teleportation (BQT) protocol that…
We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is…
In this paper we present the following quantum compression protocol: P : Let $\rho,\sigma$ be quantum states such that $S(\rho || \sigma) = \text{Tr} (\rho \log \rho - \rho \log \sigma)$, the relative entropy between $\rho$ and $\sigma$, is…
Einstein-Podolsky-Rosen- (EPR) and the more powerful Mayers-Lo-Chau attack impose a serious constraint on quantum bit commitment (QBC). As a way to circumvent them, it is proposed that the quantum system encoding the commitment chosen by…
A protocol-independent secrecy theorem is established and applied to several non-trivial protocols. In particular, it is applied to protocols proposed for protecting the computation results of free-roaming mobile agents doing comparison…