Counterfactual quantum key distribution (QKD) enables two parties to share a secret key using an interaction-free measurement. Here, we point out that the efficiency of counterfactual QKD protocols can be enhanced by including noncounterfactual bits. This inclusion potentially gives rise to the possibility of noiseless attacks, in which Eve can gain knowledge of the key bits without introducing any errors in the quantum channel. We show how this problem can be resolved in a simple way that naturally leads to the idea of ``counterfactual security,'' whereby the noncounterfactual key bits are indicated to be secure by counterfactual detections. This method of enhancing the key rate is shown to be applicable to various existing quantum counterfactual key distribution protocols, increasing their efficiency without weakening their security.
Counterfactual quantum key distribution (QKD) enables two parties to share a secret key using an interaction-free measurement. Here, we point out that the efficiency of counterfactual QKD protocols can be enhanced by including noncounterfactual bits. This inclusion potentially gives rise to the possibility of noiseless attacks, in which Eve can gain knowledge of the key bits without introducing any errors in the quantum channel. We show how this problem can be resolved in a simple way that naturally leads to the idea of ``counterfactual security,'' whereby the noncounterfactual key bits are indicated to be secure by counterfactual detections. This method of enhancing the key rate is shown to be applicable to various existing quantum counterfactual key distribution protocols, increasing their efficiency without weakening their security.
Recently, a ``counterfactual'' quantum-key-distribution scheme was proposed by T.-G. Noh [Phys. Rev. Lett. 103, 230501 (2009)]. In this scheme, two legitimate distant peers may share secret keys even when the information carriers are not traveled in the quantum channel. We find that this protocol is equivalent to an entanglement distillation protocol. According to this equivalence, a strict security proof and the asymptotic key bit rate are both obtained when a perfect single-photon source is applied and a Trojan horse attack can be detected. We also find that the security of this scheme is strongly related to not only the bit error rate but also the yields of photons. And our security proof may shed light on the security of other two-way protocols.
\n It is interesting that counterfactual quantum cryptography protocols allow two remotely separated parties to share a secret key without transmitting any signal particles. Generally, these protocols, expected to provide security advantages, base their security on a translated no-cloning theorem. Therefore, they potentially exhibit unconditional security in theory. In this letter, we propose a new Trojan horse attack, by which an eavesdropper Eve can gain full information about the key without being noticed, to real implementations of a counterfactual quantum cryptography system. Most importantly, the presented attack is available even if the system has negligible imperfections. Therefore, it shows that the present realization of counterfactual quantum key distribution is vulnerable.\n
In counterfactual quantum key distribution (QKD), two remote parties can securely share random polarization-encoded bits through the blocking rather than the transmission of particles. We propose a semi-counterfactual QKD, i.e. , one where the secret bit is shared, and also encoded, based on the blocking or non-blocking of a particle. The scheme is thus semi-counterfactual and not based on polarization encoding. As with other counterfactual schemes and the Goldenberg-Vaidman protocol, but unlike BB84, the encoding states are orthogonal and security arises ultimately from single-particle non-locality. Unlike any of them, however, the secret bit generated is maximally indeterminate until the joint action of Alice and Bob. We prove the general security of the protocol, and study the most general photon-number–preserving incoherent attack in detail.
The information-disturbance tradeoff lies at the heart of quantum key distribution (QKD), allowing a sender and a receiver to monitor eavesdropping in the communication channel by checking for errors in the transmission. Even so, here we show that for a class of QKD protocols based on the principle of interaction-free measurement, an eavesdropper Eve can obtain partial information noiselessly, i.e., in such a way that the disturbance produced does not show up during the error checking. The proposed attack is shown to be the optimal individual noiseless attack. An implication of the noiselessness is that even though error correction is not required, privacy amplification (PA) is necessary. For example, in the case of the protocol of [T.-G. Noh, PRL 103, 230501 (2009)], the compression factor of PA is 0.68 in the case of an individual, noiseless attack. For the noisy generalization of the above attack, where Eve introduces noise into the communication channel without adding noise to the eavesdropping channel, the security requirement entails a lower bound on the noise threshold of about 11%, assuming that the transmitted particles are single photons.
Compared with the traditional BB84 protocol, the counterfactual quantum key distribution (QKD) does not rely on any signal travelling in the quantum channel, and therefore can present a security advantage where Eve cannot fully access signal. However, the practical system may be damaged in a scenario where the devices are untrusted. In this paper, we analyze the security of counterfactual QKD in untrusted detectors scenario. We show that the requirement to disclose "which detector clicked" has become the main loophole in all counterfactual QKD versions. An eavesdropping scheme which is similar to the memory attack on device-independent QKD could break its security by exploiting detectors' imperfections. We consider two different counterfactual QKD protocols and analyze their security against this major loophole. One is a modified Noh09 protocol, which would be secure in untrusted detectors context. Another is a variant of counterfactual QKD with high efficiency (Phys. Rev. A 104 (2021) 022424) against a series of detectors side-channel attacks as well as against other attacks that exploit detectors imperfections.
In counterfactual quantum key distribution (QKD), two remote parties can share a secure \nsecret random key even without transmission of a physical particle (a non-vacuum pulse) through the \nchannel. A QKD scheme is proposed which is counterfactual in one of the bits, and in which the secret bits \nare not encoded in the polarization, but in the joint action of Alice and Bob. On the conceptual level, our \nscheme throws new light on the origin of security in counterfactual cryptography. On the practical side, \nnon-polarization encoding makes it robust against certain trojan horse attacks. We study the the general \nphoton-number preserving incoherent attack in detail.