Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1007.3066 · Physical Review A

Security of counterfactual quantum cryptography

Zhen−Qiang Yin, Hong-Wei Li, Wei Chen, Zheng‐Fu Han, Guang‐Can Guo

Published Oct 27, 2010• 80 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.82.042335

Related papers

Counterfactual quantum cryptography based on weak coherent states

Zhen−Qiang Yin, Hong-Wei Li, Yao Yao +5 more

In the ``counterfactual quantum cryptography'' scheme [T.-G. Noh, Phys. Rev. Lett. 103, 230501 (2009)], two legitimate distant peers may share secret-key bits even when the information carriers do not travel in the quantum channel. The security of this protocol with an ideal single-photon source has been proved by Yin et al. [Z.-Q. Yin, H. W. Li, W. Chen, Z. F. Han, and G. C. Guo, Phys. Rev. A 82, 042335 (2010)]. In this paper, we prove the security of the counterfactual-quantum-cryptography scheme based on a commonly used weak-coherent-laser source by considering a general collective attack. The basic assumption of this proof is that the efficiency and dark-counting rate of a single-photon detector are consistent for any $n$-photon Fock states. Then through randomizing the phases of the encoding weak coherent states, Eve's ancilla will be transformed into a classical mixture. Finally, the lower bound of the secret-key-bit rate and a performance analysis for the practical implementation are both given.

Physical Review A•Aug 13, 2012•37 citations

Security flaw of counterfactual quantum cryptography in practical setting

Yanbing Li, Qiaoyan Wen, Li, Zi-Chen

Recently, counterfactual quantum cryptography proposed by T. G. Noh [Phys. Rev. Lett. 103, 230501 (2009)] becomes an interesting direction in quantum cryptography, and has been realized by some researchers (such as Y. Liu et al's [Phys. Rev. Lett. 109, 030501 (2012)]). However, we find out that it is insecure in practical high lossy channel setting. We analyze the secret key rates in lossy channel under a polarization-splitting-measurement attack. Analysis indicates that the protocol is insecure when the loss rate of the one-way channel exceeds $50%$.

arXiv:1312.1436•Dec 5, 2013•2 citations

Practical Stabilization of Counterfactual Quantum Cryptography

Mu-Sheng Jiang, Shi‐Hai Sun, Lin-Mei Liang

A novel counterfactual quantum key distribution scheme was proposed by T.-G. Noh and a strict security analysis has been given by Z.-Q.Yin, in which two legitimate geographical separated couples may share secret keys even when the key carriers are not traveled in the quantum channel. However, there are still plenty of practical details in this protocol that haven’t been discussed yet, which are of significant importance in physical implementation. In this paper, we will give a practical analysis on such kind of counterfactual quantum cryptography in the aspects of quantum bit error rate (QBER) and stabilization. Furthermore, modified schemes are proposed, which can obtain lower QBER and will be much more robust on stabilization in physical implementation.

Journal of Quantum Information Science•Jan 1, 2011•1 citation

Counterfactual attack on counterfactual quantum key distribution

Sheng Zhang, Jian Wnang, Chao Jing Tang

\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

Europhysics Letters (EPL)•May 1, 2012•15 citations

Counterfactual quantum key distribution without polarization encoding

Akshata Shenoy H., R. Srikanth, Srinivas Talabattula

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.

•Jan 1, 2013•4 citations

Security proof of counterfactual quantum cryptography against general intercept-resend attacks and its vulnerability

Sheng Zhang, Jian Wang, Chao-Jing Tang

Counterfactual quantum cryptography, recently proposed by Noh, is featured with no transmission of signal particles. This exhibits evident security advantages, such as its immunity to the well-known photon-number-splitting attack. In this paper, the theoretical security of counterfactual quantum cryptography protocol against the general intercept-resend attacks is proved by bounding the information of an eavesdropper Eve more tightly than in Yin's proposal [ Phys. Rev. A 82 042335 (2010) ]. It is also shown that practical counterfactual quantum cryptography implementations may be vulnerable when equipped with imperfect apparatuses, by proving that a negative key rate can be achieved when Eve launches a time-shift attack based on imperfect detector efficiency.

arXiv:1103.0601•Chinese Physics B•Jun 1, 2012•12 citations
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.
In the ``counterfactual quantum cryptography'' scheme [T.-G. Noh, Phys. Rev. Lett. 103, 230501 (2009)], two legitimate distant peers may share secret-key bits even when the information carriers do not travel in the quantum channel. The security of this protocol with an ideal single-photon source has been proved by Yin et al. [Z.-Q. Yin, H. W. Li, W. Chen, Z. F. Han, and G. C. Guo, Phys. Rev. A 82, 042335 (2010)]. In this paper, we prove the security of the counterfactual-quantum-cryptography scheme based on a commonly used weak-coherent-laser source by considering a general collective attack. The basic assumption of this proof is that the efficiency and dark-counting rate of a single-photon detector are consistent for any nnn-photon Fock states. Then through randomizing the phases of the encoding weak coherent states, Eve's ancilla will be transformed into a classical mixture. Finally, the lower bound of the secret-key-bit rate and a performance analysis for the practical implementation are both given.
Recently, counterfactual quantum cryptography proposed by T. G. Noh [Phys. Rev. Lett. 103, 230501 (2009)] becomes an interesting direction in quantum cryptography, and has been realized by some researchers (such as Y. Liu et al's [Phys. Rev. Lett. 109, 030501 (2012)]). However, we find out that it is insecure in practical high lossy channel setting. We analyze the secret key rates in lossy channel under a polarization-splitting-measurement attack. Analysis indicates that the protocol is insecure when the loss rate of the one-way channel exceeds 5050%50.
A novel counterfactual quantum key distribution scheme was proposed by T.-G. Noh and a strict security analysis has been given by Z.-Q.Yin, in which two legitimate geographical separated couples may share secret keys even when the key carriers are not traveled in the quantum channel. However, there are still plenty of practical details in this protocol that haven’t been discussed yet, which are of significant importance in physical implementation. In this paper, we will give a practical analysis on such kind of counterfactual quantum cryptography in the aspects of quantum bit error rate (QBER) and stabilization. Furthermore, modified schemes are proposed, which can obtain lower QBER and will be much more robust on stabilization in physical implementation.
\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 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.
Counterfactual quantum cryptography, recently proposed by Noh, is featured with no transmission of signal particles. This exhibits evident security advantages, such as its immunity to the well-known photon-number-splitting attack. In this paper, the theoretical security of counterfactual quantum cryptography protocol against the general intercept-resend attacks is proved by bounding the information of an eavesdropper Eve more tightly than in Yin's proposal [ Phys. Rev. A 82 042335 (2010) ]. It is also shown that practical counterfactual quantum cryptography implementations may be vulnerable when equipped with imperfect apparatuses, by proving that a negative key rate can be achieved when Eve launches a time-shift attack based on imperfect detector efficiency.