Security of EPR-based Quantum Key Distribution

In this letter a deterministic secure direct bidirectional communication protocol is proposed by using the quantum entanglement and local unitary operations on one photon of the Einstein-Podolsky-Rosen (EPR) photon pair.

Recently, in Sci. Rep. \textbf{6} (2016) 28767, Li et al., have proposed a scheme for quantum key distribution using Bell states. This comment provides a proof that the proposed scheme of Li et al., is insecure as it involves leakage of information. Further, it is also shown that all the error rates computed in the Li et al.'s paper are incorrect as the authors failed to recognize the fact that any eavesdropping effort will lead to entanglement swapping. Finally, it is establ...

Quantum key distribution (QKD) relies on quantum and classical procedures in order to achieve the growing of a secret random string -the key- known only to the two parties executing the protocol. Limited intrinsic efficiency of the protocol, imperfect devices and eavesdropping produce errors and information leakage from which the set of measured signals -the raw key- must be stripped in order to distill a final, information theoretically secure, key. The key distillation proc...

Quantum Key Distribution with the BB84 protocol has been shown to be unconditionally secure even using weak coherent pulses instead of single-photon signals. The distances that can be covered by these methods are limited due to the loss in the quantum channel (e.g. loss in the optical fiber) and in the single-photon counters of the receivers. One can argue that the loss in the detectors cannot be changed by an eavesdropper in order to increase the covered distance. Here we sh...

In the paper [Zhang, Li and Guo, Phys. Rev. A 64, 024302 (2001)], a quantum key distribution protocol based on quantum encryption was proposed, in which the quantum key can be reused. However, it is shown that, if Eve employs a special strategy to attack, this protocol becomes insecure because of the reused quantum key. That is, Eve can elicit partial information about the key bits without being detected. Finally, a possible improvement of the Zhang-Li-Guo protocol is propose...

We introduce a new quantum key distribution protocol that uses d-level quantum systems to encode an alphabet with c letters. It has the property that the error rate introduced by an intercept-and-resend attack tends to one as the numbers c and d increase. In dimension d=2, when the legitimate parties use a complete set of three mutually unbiased bases, the protocol achieves a quantum bit error rate of 57.1%. This represents a significant improvement over the 25% quantum bit e...

Quantum key distribution (QKD) protocols aim at allowing two parties to generate a secret shared key. While many QKD protocols have been proven unconditionally secure in theory, practical security analyses of experimental QKD implementations typically do not take into account all possible loopholes, and practical devices are still not fully characterized for obtaining tight and realistic key rates. We present a simple method of computing secure key rates for any practical imp...

The phenomenon of quantum erasure has long intrigued physicists, but has surprisingly found limited practical application. Here, we propose an erasure-based protocol for quantum key distribution (QKD) that promises inherent security against detector attacks.

We present a complete protocol for BB84 quantum key distribution for a realistic setting (noise, loss, multi-photon signals of the source) that covers many of todays experimental implementations. The security of this protocol is shown against an eavesdropper having unrestricted power to manipulate the signals coherently on their path from sender to receiver. The protocol and the security proof take into account the effects concerning the finite size of the generated key.

Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? We present a protocol with this constraint, an...