A Estimation of the secret key rate

# Detector-device-independent QKD: security analysis and fast implementation

## Abstract

One of the most pressing issues in quantum key distribution (QKD) is the problem of detector side-channel attacks. To overcome this problem, researchers proposed an elegant “time-reversal” QKD protocol called measurement-device-independent QKD (MDI-QKD), which is based on time-reversed entanglement swapping. However, MDI-QKD is more challenging to implement than standard point-to-point QKD. Recently, an intermediary QKD protocol called detector-device-independent QKD (DDI-QKD) has been proposed to overcome the drawbacks of MDI-QKD, with the hope that it would eventually lead to a more efficient detector side-channel-free QKD system. Here, we analyze the security of DDI-QKD and elucidate its security assumptions. We find that DDI-QKD is not equivalent to MDI-QKD, but its security can be demonstrated with reasonable assumptions. On the more practical side, we consider the feasibility of DDI-QKD and present a fast experimental demonstration (clocked at 625 MHz), capable of secret key exchange up to more than 90 km.

## I Introduction

Secure communication is a cornerstone of our society and finding a way to protect our personal data while making it globally accessible is a profound challenge. Quantum key distribution (QKD) enables the secure establishment of cryptographic keys between two remote users, Alice and Bob Bennett and Brassard (1984). Importantly, the security of QKD depends only on the principles of quantum physics and can be proven to be secure against quantum eavesdroppers under certain assumptions about the involved devices Gisin et al. (2002); Dušek et al. (2006); Scarani et al. (2009). However, in practice, actual devices may deviate from their ideal specifications and lead to security loopholes Lo et al. (2014).

In the last decade, much attention has been devoted to understanding the impact on QKD security due to the behaviour of single-photon detectors and how one can break the security of QKD by exploiting the physics of their operation. It turns out that there are several ways to exploit the imperfections of the detectors Zhao et al. (2008a); Lydersen et al. (2010); Wiechers et al. (2011). These findings exemplify the fact that, like all crypto-systems, QKD is only as strong as its weakest link, despite the fact that QKD is in principle secure against general attacks. To overcome this security loophole, researchers proposed an elegant “time-reversal” protocol called measurement-device-independent QKD (MDI-QKD), which is based on the principle of entanglement swapping Lo et al. (2012); Li et al. (2014); Valivarthi et al. (2015); Comandar et al. (2016); Wang et al. (2015); Tang et al. (2016). More specifically, the central idea is to perform a Bell state measurement (BSM) between two qubit states, which are randomly prepared by Alice and Bob, as in the standard Bennett-Brassard 1984 (BB84) QKD protocol Bennett and Brassard (1984). In this case, the measurement unit is seen as part of the untrusted quantum channel and security is automatically guaranteed against all detector side-channel attacks.

MDI-QKD is however more challenging to implement than standard point-to-point (PtP) QKD. First, it requires the interference of two independent and indistinguishable photons over long distances. This could be challenging because the photons have to simultaneously arrive at the BSM while maintaining their indistinguishability in all degrees-of-freedom (DoFs). Second, the secret key rate (SKR) is limited by the achievable coincidence rate at the BSM, which is at most 50% of the photon detection rate assuming linear optics. Third, the finite-key analysis of MDI-QKD is less efficient than standard PtP QKD in that it requires a much larger post-processing block size Curty et al. (2014) than its PtP counterpart Lim et al. (2014a). Nevertheless, we note that an exchange of around 5 kbps over 100 km has been recently demonstrated (neglecting the finite-key effects) Comandar et al. (2016).

Recently, a family of QKD protocols was proposed to simplify MDI-QKD, which we collectively refer to as detector-device-independent QKD (DDI-QKD) Lim et al. (2014b); González et al. (2015); Liang et al. (2015). These QKD protocols use the fact that one can encode multiple qubits (using different DoFs) onto a single photon and that these qubits can be manipulated independently. In this way, one can imagine MDI-QKD being carried out using only one photon as a carrier for Alice and Bob’s qubits: Alice first encodes her qubit into the photon and then sends it to Bob, who encodes his qubit onto another DoF. The resulting two-qubit photon is then sent to a BSM apparatus. Therefore, only a single photon detection is required (like in PtP QKD). Since the guiding principles of DDI-QKD are similar to those of MDI-QKD, it is conjectured that the security level of DDI-QKD is comparable to MDI-QKD. Here, we present a thorough security analysis of DDI-QKD together with a new experimental implementation of a complete crypto-system.

## Ii Principles of DDI-QKD

The conceptual setup is presented in Fig. 1 (a). Alice encodes a qubit in the polarization DoF of a single-photon and sends it to Bob. At the input of Bob a polarizing beam splitter (PBS) converts the polarization modes into spatial modes such that the qubit of Alice is converted to a state of the form , where and represent the transmitted and reflected path of the PBS, respectively. Then, Bob encodes a qubit in the polarization DoF of the photon. The same polarization state needs to be encoded in the two paths. The state of the photon is then .

A BSM is performed by recombining the two spatial modes via a PBS and applying a projection in the basis on both output arms using two additional PBSs. and correspond to and , respectively. A click in one of the four outputs corresponds to a projection into one of the following Bell states:

 ⎧⎨⎩|Φ±⟩=1√2[|r⟩|H⟩±|t⟩|V⟩]|Ψ±⟩=1√2[|r⟩|V⟩±|t⟩|H⟩]. (1)

In order to exchange secret keys, the protocol is the following: Alice and Bob independently encode states randomly chosen out of the four following BB84 states . The probabilities for each Bell state are given in Tab. 1. After sifting, one cannot determine the bit sent by Alice only from the knowledge of which detector has clicked. Both the result of the BSM and the state encoded by Bob are necessary to retrieve the bit chosen by Alice, using Tab. 2. Before describing the practical implementation, we will take a closer look at the security.

## Iii Security of DDI-QKD

The security of DDI-QKD is based on the following assumptions: i) Alice and Bob’s random number generators as well as the classical post-processing are trusted. This basic assumption is necessary for all QKD schemes, including device-independent (DI-QKD) protocols. ii) Alice and Bob’s linear optical circuits are fully characterized and cannot be influenced by any eavesdropper, commonly denoted as Eve. iii) Eve may exploit imperfect detectors via the optical fiber, but she has no physical access to the detectors, in particular she has no access to the outputs of the interferometer. iv) The detectors may have some defects, but are not from a malicious provider. This means they are independent of Eve.

In the case of single-qubit quantum channels (i.e. Eve is restricted to sending pulses of light to Bob, which are on the single photon level) the first two assumptions are sufficient in order to prove formally the security of DDI-QKD. This has been shown in Refs. Lim et al. (2014b); González et al. (2015), and is detailed in the Appendix A. This also means that for this scenario DDI-QKD and MDI-QKD are equivalent.

The situation is more complicated if we consider attacks based on multi-photon states. With strong pulses, Eve could easily make a Trojan horse attack and measure Bob’s settings if she had access to the output of Bob’s interferometer. But this is in contradiction with assumption iii). Eve could also try a more subtle Trojan horse attack as proposed in Ref. Qi (2015), where the detectors have shared randomness with Eve, which is in contradiction with assumption iv). Another attack could be the siphoning attack presented in Appendix B, which works even if the quantum channel is restricted to a single spatial-temporal mode. However, this attack is not compatible with assumptions iii) and iv). Finally, it is important to note that Trojan horse attacks based on back reflection, which can affect both Alice and Bob, have to be avoided by using a set of isolators and frequency filters as is the case for MDI-QKD as well.

Let us now consider the class of attacks based on detector blinding Lydersen et al. (2010). To perform such attacks, the eavesdropper shines strong classical light onto the detectors, such that they all cease to work in the Geiger mode and instead begin to operate in the linear regime. In this regime, if any of the detectors receive a light pulse which exceeds a certain threshold, a detection signal can be generated. From the perspective of Bob, this signal is indistinguishable from that generated by a single-photon detection in the Geiger mode. Let us denote by the threshold of the detector . If only one detector (one Bell state) was used, the system is equivalent to a normal BB84 protocol and is potentially vulnerable as shown in Ref. Lydersen et al. (2010). However, if we consider the DDI-QKD setup with a complete BSM, such an attack will be detected by looking at the detection statistics. In the case where the thresholds of the four detectors are identical, the blinding attack will generate double detections. When this happens, Bob assigns a detection to a random detector, which affects directly the quantum bit error rate (QBER). In the case where the thresholds are different for every detector, for example if , then it is indeed possible to generate a detection in while does not click. However, Eve will not be able to make click independently. More generally, with such an attack, she will not be able to reproduce the expected detection probabilities for all detectors and all settings of Alice and Bob, as detailed in Tab. 1. Note that, active randomization of the detection statistics has been proposed as a countermeasure against blinding attacks Ferreira da Silva et al. (2015); Lim et al. (2015).

In short, despite their conceptual similarities, DDI-QKD is not equivalent to MDI-QKD and the additional, arguably very reasonable, assumptions iii) and iv) have to be made in order to guarantee its security.

## Iv Experimental setup

In our previous proof-of-principle experiment Lim et al. (2014b), Alice and Bob used the polarization and spatial DoFs, respectively, to encode their qubits. It is challenging to achieve high encoding rates with such an implementation, because Bob’s phase modulator has to be polarization insensitive, something that is not possible with high-speed electro-optic modulators. To overcome this, we use the polarization DoF at Bob and simplify the experimental setup by substituting the Mach-Zehnder configuration (Fig. 1 (a)) with a Sagnac interferometer (Fig. 1 (b)). In this way, no active phase stabilization is needed to preserve the state encoded by Alice. Moreover, only one polarization modulator, supplemented with a Faraday rotator and a half-wave plate (HWP), is necessary to encode the same state of polarization in both directions, i.e. clockwise and counter-clockwise.

Our practical implementation is depicted in Fig. 2. Alice’s source starts with a gain-switched DFB laser at 1554.94 nm (ITU channel C28) triggered at 625 MHz, which generates light pulses with a duration of 80 ps. The qubit states are encoded via a set of fiber polarization controllers (PCs) and a birefringent lithium-niobate (LiNbO) phase modulator (PM) driven by a 3-level pulse generator. Photons enter the PM in the state and the effect of the PM is to transform the state into , where is the encoded phase. To compensate the temporal walk-off (around 10 ps) introduced by the birefringence of the modulator, 8 m of polarization-maintaining fiber (PMF) (high-birefringence fiber) is added. The temperature of the birefringent elements (PM and PMF) is actively stabilized to avoid polarization drifts. An additional unitary transformation is performed via a PC placed at the output of the PMF to generate the qubits in the Z or X basis.

On Bob’s side, the polarization qubits of Alice are converted into spatial qubits by a free-space four-port PBS with a polarization rejection superior than 1/1000 for the four arms. As represented in Fig. 2, at the outputs of the PBS, a Sagnac loop consists of a Faraday rotator, a PM and a PMF, identical to those of Alice. These elements transform both components of Alice’s qubit - those that rotate clockwise and counter-clockwise in the Sagnac loop - such that they pass through the PM with the same state of polarization and at the same time. Alice’s encoding in polarization has therefore been completely transformed into a spatial encoding. Whilst Bob’s qubit is encoded by the PM in the same way that Alice had encoded her own.

To perform the BSM, a PC and a PBS is placed in each output port of the loop. The outputs of the BSM corresponding to and are delayed by 800 ps and combined with and , respectively, by means of PBSs. This allows the use of just two detectors for all four Bell states. Bob’s setup has 7.1 dB of attenuation mainly due to the PM (4 dB). The photons are detected by two InGaAs/InP negative feedback avalanche diodes operating in the free-running mode and cooled with a free-piston Stirling cooler Korzh et al. (2014). The laser, the PMs and the detectors are connected to two field-programmable gate arrays (FPGAs) placed on Alice and Bob’s side. A service channel operating on a separate optical fiber is used to synchronize the two parties and to exchange data during the key sifting phase Walenta et al. (2014); Korzh et al. (2015).

For the key exchange protocol, we use the basis to generate the data and the basis to estimate the phase error rate. To maximize the key rate, the probability of choosing the basis is 87.5, both on Alice and Bob’s side. To simplify the experimental implementation, Alice uses only three states  Fung and Lo (2006); Tamaki et al. (2014), while Bob uses four states as usual. For a standard BB84 protocol with four states, the QBER in the basis is approximated by

 pX,err≈N+−+N−+N+++N−−+N+−+N−+, (2)

with the number of detections where Alice prepares the state and Bob’s measurement outcome is . For a three state protocol, the phase error rate can be formulated in terms of matched and mismatched bases statistics. In particular, we have:

 pX,err≈N+−N+++N+−+12(NH+NH++NH−+NV+NV++NV−−1). (3)

The SKR is calculated from the error rates in the and bases for different transmissions as a function of , the mean number of photons per pulse sent by Alice. We make no assumption about the detection efficiency of the detectors as well as the transmission of Bob’s setup. The upper bound on the extractable secret key length is given by:

 ℓ=⌊slbZ,1(1−h2(δubZ,ph))−leakEC−4log2(7/εsec)−log2(1/εcor)⌋, (4)

where is the lower bound on the number of single-photon detections in the basis, is the upper bound on the phase error rate, is the number of bits revealed during the error correction step, and and are the secrecy and correctness parameters, respectively. We fixed the security parameter to , which is similar to those typically used in PtP QKD systems Korzh et al. (2015). Please refer to Appendix A for more details about equations 3 and 4 as well as their derivation.

## V Key distillation

We performed an exchange of secret keys with complete distillation - i.e. including finite key analysis and privacy amplification - at three different distances simulated with a variable attenuator. For every result depicted in Tab. 3 we optimized the following parameters in order to maximize the SKR: , the number of photons per pulse sent by Alice; the dead time of the detectors and the temperature of the detectors. The error correction was carried out using an optimized Cascade algorithm, implemented in C++, which achieved an efficiency of reconciliation of 1.04 for a QBER of 3% Martínez-Mateo et al. (2015). The efficiency of reconciliation is defined as , with the number of bits disclosed during the error correction, the length of the key before error correction and the conditional entropy between the keys of Alice and Bob before the error correction. In order to reduce the effect of finite-key statistics, the privacy amplification was carried out on a block size of  bits. We obtained a SKR of 1.8 kbps for an attenuation of 6.8 dB corresponding to a distance of 34 km considering 0.2 dB/km loss.

We also performed exchange of secret keys for additional distances without taking into account the finite key analysis. The corresponding SKRs as a function of the attenuation (converted into fiber distance considering loss of  dB/km) between Alice and Bob are plotted in Fig. 3 (a). We obtained an SKR of 8.2 bps at 91 km. Let us emphasize that these data are obtained from the statistics of actual raw keys. Moreover, the corresponding error rates in the and bases are given in Fig. 3 (b). The difference between and is mainly due to the polarization depend loss of the Sagnac loop elements which introduces a small bias between H and V.

In comparison to a standard BB84 implementation, our system is affected by the significant loss in Bob’s device. It could be possible to reduce this loss by at least 2 dB by changing the PM. Nevertheless, we achieved key exchange over distances up to 91 km without decoy states Hwang (2003); Lo et al. (2005); Wang (2005), which would not be possible for MDI-QKD. The maximal distance could be significantly improved by adding decoy-state preparation at Alice in order to optimize the bound on the single photon detections. In this configuration we expect to exchange a secret key at a rate of 2 bps over 250 km of standard single mode fiber. This prediction is based on a simulation which takes into account loss in the apparatus and error rates as measured in our experiment, as well as finite key analysis with a block size of bits.

## Vi Conclusion

We discussed the security of DDI-QKD, which is not equivalent to MDI-QKD in the most general scenario. Nevertheless, we have shown that under very reasonable assumptions, its security can be guaranteed. Although the title “detector-device-independent” could be debatable, DDI-QKD offers improved security compared to normal PtP protocols while being easier to implement than MDI-QKD. In particular DDI-QKD requires only single-photon interference, the BSM is 100% efficient and the performance in the finite-key scenario is similar to PtP QKD.

We implemented a complete high-speed version of the DDI-QKD protocol clocked at 625 MHz, based on polarization encoded qubits. We distilled secret keys, whilst accounting for finite-key effects, at a rate of 1.8 kbps for a distance of 34 km. Furthermore, we achieved a key exchange over 91 km (without decoy-state preparation).

## Acknowledgements

We would like to acknowledge Jesús Martínez-Mateo for providing the error correction code, and Bing Qi and Marcos Curty for helpful discussions. We thank the Swiss NCCR QSIT and the European EMPIR MIQC2 for financial support. C. C. W. Lim acknowledges support from the Oak Ridge National Laboratory directed research and development program.

## Appendix A Estimation of the secret key rate

Here, we first present briefly the security analysis of our QKD protocol against a large class of attacks under the assumption that the adversary, Eve, can only forward a qubit or a vacuum state in each use of the quantum channel. Then we show how to estimate the SKR from our experimental raw data.

In our QKD implementation, Alice uses a phase-randomized laser source with intensity to prepare her qubits. In this case, the source generates in each run a vacuum state with probability , a single-photon state with probability , and a multi-photon state with probability . To deal with events that are not single photons, we conservatively assume that (1) multi-photon states are insecure and (2) vacuum states are secure qubit states. The former is due to the fact that Eve can perform photon-number splitting attacks and the latter is due to the fact that vacuum states carry zero information about Alice’s bit values; this also applies to Bob.

Recall that in each run of the implementation, Alice randomly prepares her qubit in one of the three states . This choice of encoding is known as the three-state QKD protocol Fung and Lo (2006), and it has been recently shown that it is loss-tolerant if mismatched bases statistics are taken into consideration Tamaki et al. (2014). By loss-tolerant, we mean that three-state QKD is resilient against attacks that exploit channel loss and source errors (i.e., encoding flaws). Interestingly, it has also been shown that the security performance of three-state QKD is similar to BB84 QKD. This means that the fourth qubit state, , is redundant.

Before we state the security bounds for our protocol, it is instructive to spell out the security criteria that we are using. For some small protocol errors, , we say that our protocol is -secure if it is -correct and -secret. More specifically, let and be Alice and Bob’s output keys, then the former is satisfied if , i.e., the secret keys are identical except with a small probability . The latter is satisfied if where is the classical-quantum state describing the joint state of and is the uniform mixture of all possible values of , and is the probability that the protocol aborts. Importantly, this secrecy criterion guarantees that the protocol is universally composable: the pair of secret keys can be safely used in any cryptographic task, e.g., for encrypting messages, that requires a perfectly secure key.

To analyze the security of our QKD implementation, we work in a counterfactual scenario where Alice and Bob are using the asymmetric BB84 QKD, i.e., the basis is used for the key and the basis is used for parameter estimation. In this scenario, an upper bound on the extractable secret key length is obtained by using the bound given in Ref. (Lim et al., 2014a):

 ℓ=⌊slbZ,1(1−h2(δubZ,ph))−leakEC−4log2(7/εsec)−log2(1/εcor)⌋, (5)

where is the lower bound on the number of single-photon detections in the basis, is the upper bound on the phase error rate, is the number of bits revealed during the error correction step 1, and is the binary entropy function. In the following, we show how to compute and using measurement statistics obtained in the actual QKD system. To start with, we denote by and the total number of detections in the and bases, respectively. Then, we have that the total number of detections (in either basis) is a sum of detections conditioned on the number of photons sent by Alice. For example, for the basis, we have , where is the number of detections conditioned on Alice sending -photon states. Note that since all vacuum states are assumed to be secure qubit states, we may absorb into .

Let be the number of signals with which Alice and Bob choose the basis, then a simple lower bound on is obtained by subtracting the number of multi-photon states sent by Alice from the total number of detections,

 slbZ,1=nZ−G(NZ), (6)

where

 G(x):=⌊x(1−(1+μ)e−μ)+√log(ε−1% sec)x/2⌋. (7)

Here we used the fact that the photon number distribution follows a Poisson distribution and that maximally of the states are multi-photon states; although the latter statement only holds with probability . Likewise, we have the same bound for the basis,

 slbX,1=nX−G(NX). (8)

Next, we need to estimate the number of phase errors in . In BB84 QKD, this estimation problem is a classical random sampling (without replacement) problem, and one can use the error rate in the basis to estimate the phase error rate in the basis. However, in three-state QKD, one only has partial observation of the error rate in the basis, since only the state is sent in the basis. Recently, it has been shown that the phase error rate can be exactly estimated (in the asymptotic limit) by using the mismatched bases statistics and the partial error rate observed in the basis Tamaki et al. (2014). Below, for completeness, we provide an alternative derivation that relates to the above measurement statistics.

Suppose Alice is able to prepare single-photon states and Eve interacts independently and identically with each photon; later we will consider the scenario with weak laser pulses. Furthermore, without loss of generality, we may assume that the quantum channel has perfect transmission, since Bob’s basis choice is independent of Eve’s attacks and Alice and Bob postselect the measurement statistics. In this scenario, we may describe Eve’s actions using the following transformations:

 UAE|H⟩A|ϕ⟩E=|H⟩A|ϕ1⟩E+|V⟩A|ϕ2⟩EUAE|V⟩A|ϕ⟩E=|H⟩A|ϕ3⟩E+|V⟩A|ϕ4⟩E, (9)

where for are Eve’s quantum states (not necessarily normalized). Furthermore, since is unitary, we have , , and , ; since the context is now clear, hereafter we will omit the subsystem labels. Using the above transformations, we thus have

 UAE|±⟩|ϕ⟩=|H⟩(|ϕ1⟩±|ϕ3⟩)+|V⟩(|ϕ2⟩±|ϕ4⟩)√2. (10)

Let and , then the probability that Bob detects (using the basis) when Alice has sent (in the basis) follows

 pZZ(H|H)=⟨ϕ1|ϕ1⟩pZZ(V|H)=⟨ϕ2|ϕ2⟩pZZ(H|V)=⟨ϕ3|ϕ3⟩pZZ(V|V)=⟨ϕ4|ϕ4⟩. (11)

From the above, the probabilities for mismatch basis choices are thus given by

 pXZ(±|H)=12±% Re[⟨ϕ1|ϕ2⟩]pXZ(±|V)=12±Re[⟨ϕ3|ϕ4⟩]pZX(H|±)=⟨ϕ1|ϕ1⟩2+⟨ϕ3|ϕ3⟩2±Re[⟨ϕ1|ϕ3⟩]pZX(V|±)=⟨ϕ2|ϕ2⟩2+⟨ϕ4|ϕ4⟩2±Re[⟨ϕ2|ϕ4⟩]. (12)

Since , we have . Accordingly, we have

 pXX(+|±)=12(1+% Re[⟨ϕ1|ϕ2⟩]+Re[⟨ϕ3|ϕ4⟩]±Re[⟨ϕ2|ϕ3⟩]±Re[⟨ϕ1|ϕ4⟩]). (13)

In the counterfactual BB84 QKD, Alice prepares with uniform probability, and the probability of error in the basis is defined as . Using the above equations, we get

 pX,err=12[pXZ(+|H)+pXZ(+|V)+2pXX(−|+)−1]. (14)

That is, the probability of observing an error in the basis statistics can be exactly estimated by three conditional probabilities: , , and .

To estimate the phase error rate in the basis using Eq. (14), we have to first estimate , , and from the observed statistics. To start with, let denote the number of detections when Alice sends light pulses prepared in and Bob encodes , and . Then, following the method as described before, we can compute a lower bound on the number of single-photon detections in for any . For instance, we have , where is the number of instances with which Alice sends and Bob chooses an encoding in the basis. With that, we can compute upper bounds on the relative frequencies associated with the above conditional probabilities, i.e., we have

 fub(±|a)=min⎧⎪⎨⎪⎩12,m(±,a)qlbX,1(a)⎫⎪⎬⎪⎭, (15)

for any . Next, by making use of Hoeffding’s inequality, we further get

 pXZ(+|a)

where . Putting everything together, we thus get

 pubX,err=12[pubXZ(+|H)+pubXZ(+|V)+2pubXX(−|+)−1]. (17)

Finally, to compute , we use the Hoeffding’s inequality again to get

 δubZ,ph:=pubX,err+K(slbX,1). (18)

## Appendix B Siphoning attacks on DDI-QKD

In this section, we present a quantum siphoning attack on BB84 and DDI-QKD. This attack is more powerful than the attack proposed in Ref. Qi (2015): it does not require shared randomness between Bob’s laboratory and Eve and works even if Bob’s input optical mode is restricted to a single spatial-temporal mode. The central idea of the attack is to exploit the fact that multi-photon states live in the tensor product of single photon subspaces, and linear optical circuits act on each photon independently. Crucially, these observations suggest that Eve can use multi-photon states to learn about Bob’s qubit choices, thereby breaking the security of DDI-QKD.

To illustrate the above idea and to understand the security boundary of DDI-QKD, we start from a conservative scenario whereby the detectors are black boxes and adversarial in nature. In particular, we assume that the untrusted detectors are controlled by an internal adversary called Fred, who can perform any quantum operation. Furthermore, we assume that Fred and Eve (who is controlling the quantum channel) are collaborators and they agree on a set of possible actions beforehand. However, Fred cannot communicate freely with Eve, since Bob’s laboratory is secure; however, as we will show below, Eve can communicate freely with Fred. Also, Fred is restricted to his own device and has no access to Bob’s linear optical circuit, e.g., Bob’s random basis choices and bit values.

On Bob’s end, we assume that he is able to restrict all input light states to a single optical spatial-temporal mode, where any quantum information is encoded in the polarization DoF. This assumption is pretty strong as it already allows Bob to rule out a large class of detector side-channel attacks, e.g., time-shifting attacks. Nevertheless, despite this assumption, we show below that DDI-QKD is insecure if the quantum channel admits multi-photon excitations of the input optical mode.

The quantum siphoning attack is carried out in three phases: (1) the intercept-and-resend phase, (2) the qubit extraction phase, and (3) the siphoning phase. In the first phase, Eve measures Alice’s qubit randomly using either the or basis, and sends a -photon state to Bob, where each photon is prepared in the equal superposition of the horizontal and vertical polarization states, i.e., . The number of photons, , is dependent on Eve’s basis choice and her measurement outcome: takes value from the set , which corresponds to . For example, means Eve measures in the basis and obtains and means she measures in the basis and obtains . Note that the set satisfies for all and for all .

In the second phase, the -photon state passes through Bob’s linear optical circuit and each photon is transformed to a four-dimensional quantum state (just before the detectors/Fred):

 |χϕf⟩Eve=(1+eiϕ)(|1⟩+|2⟩)+(1−eiϕ)(|3⟩+|4⟩)2√2, (19)

where is simply the single-photon basis states for the four output ports of Bob’s linear optical circuit. Recall that Bob’s qubit choice is denoted by . In fact, we can further simplify the above equation to reflect an effective qubit state by using the transformations: and , , giving

 |χϕf⟩Eve=(1+eiϕ)2|~0⟩+(1−eiϕ)2|~1⟩. (20)

Indeed, we see that when the input is a single-photon state, the resulting output states are the BB84 qubit states (up to local rotations), where one basis is given by

 |χ0f⟩Eve=|~0⟩,|χπf⟩Eve=|~1⟩, (21)

and the other basis given by

 |χπ/2f⟩Eve=|~+⟩+i|~−⟩√2,|χ3π/2f⟩Eve=|~+⟩−i|~−⟩√2. (22)

When the input state is a -photon state, the output is copies of Bob’s qubit; because Fred has access to all the four output ports. This means that Fred can first measure the photon number of the output state and learn about Eve’s basis choice and her measurement outcome. Then, Fred can determine , i.e., Bob’s qubit choice by performing the optimal unambiguous state discrimination (USD) measurement for photons. In particular, the regime in which Fred can unambiguously learn about starts from , with a success probability of . That is, there exists an USD measurement which Fred can perform to extract from 3 copies of with probability at least . In the general case where , it can be shown that the probability of success for a -photon injection is lower bounded by the smallest eigenvalue of the following block matrix Sun et al. (2002):

 Unknown environment 'bmatrix% (23)

where

 \mathbbmI2:=[1001],C(nj):=⎡⎢ ⎢⎣(1√2)nj(1√2)nj(1√2)nj(−1√2)nj⎤⎥ ⎥⎦.

Indeed, in the case of , we see that . Since Eve can inject an arbitrary number of photons, we have to assume the limiting case and take with for any .

In the final phase, Fred first compares Eve and Bob’s basis choices. If they are the same, he simply outputs a Bell state that is consistent with their bit values and basis choice, otherwise, he announces the measurement as inconclusive. In particular, Fred uses Tab. 1 to determine the BSM outcome. For example, if Eve’s outcome is and Bob’s qubit choice is , then Fred outputs or with probability 1/2 each. Note that this attack works whenever the quantum channel loss is .

The above quantum siphoning attack works even if Bob limits the input light state to a single optical spatial-temporal mode. Our proposed attack is essentially an entanglement-breaking operation, since it requires Eve to perform an intercept-and-resend attack. More crucially, it should be noted that this attack works as long as Eve is able to send multi-photon states to Bob. This problem is reminiscent of the security problem faced by the bi-directional “plug & play” QKD system, where Eve can apply Trojan horse attacks to learn about Alice’s bit values. Such Trojan horse attacks could be mitigated by employing countermeasures like those proposed in Ref. Zhao et al. (2008b). To conclude, our attack shows that DDI-QKD is not equivalent to MDI-QKD, despite their conceptual similarities, and additional assumptions are necessary to guarantee the security of DDI-QKD as discussed in Sec. III.

### Footnotes

1. Note that this does not include the information leakage due to error verification.

### References

1. C. H. Bennett and G. Brassard, Proc. IEEE Int. Conf. Comput. Syst. Signal Process. Bangalore, India , 175 (1984).
2. N. Gisin, G. Ribordy, W. Tittel,  and H. Zbinden, Rev. Mod. Phys. 74, 145 (2002).
3. M. Dušek, N. Lütkenhaus,  and M. Hendrych, Prog. Opt. 49, 381 (2006).
4. V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus,  and M. Peev, Rev. Mod. Phys. 81, 1301 (2009).
5. H. K. Lo, M. Curty,  and K. Tamaki, Nat. Photonics 8, 595 (2014).
6. Y. Zhao, C. H. F. Fung, B. Qi, C. Chen,  and H. K. Lo, Phys. Rev. A 78, 042333 (2008a).
7. L. Lydersen, C. Wiechers, C. Wittmann, D. Elser, J. Skaar,  and V. Makarov, Nat. Photonics 4, 686 (2010).
8. C. Wiechers, L. Lydersen, C. Wittmann, D. Elser, J. Skaar, C. Marquardt, V. Makarov,  and G. Leuchs, New J. Phys. 13, 013043 (2011).
9. H.-K. Lo, M. Curty,  and B. Qi, Phys. Rev. Lett. 108, 130503 (2012).
10. Z. Li, Y.-C. Zhang, F. Xu, X. Peng,  and H. Guo, Phys. Rev. A 89, 052301 (2014).
11. R. Valivarthi, I. Lucio-Martinez, P. Chan, A. Rubenok, C. John, D. Korchinski, C. Duffin, F. Marsili, V. Verma, M. D. Shaw, J. A. Stern, S. W. Nam, D. Oblak, Q. Zhou, J. A. Slater,  and W. Tittel, J. Mod. Opt. 62, 1141 (2015).
12. L. C. Comandar, M. Lucamarini, B. Fröhlich, J. F. Dynes, A. W. Sharpe, S. W.-B. Tam, Z. L. Yuan, R. V. Penty,  and A. J. Shields, Nat. Photonics 10, 312 (2016).
13. C. Wang, X.-T. Song, Z.-Q. Yin, S. Wang, W. Chen, C.-M. Zhang, G.-C. Guo,  and Z.-F. Han, Phys. Rev. Lett. 115, 160502 (2015).
14. Y.-L. Tang, H.-L. Yin, Q. Zhao, H. Liu, X.-X. Sun, M.-Q. Huang, W.-J. Zhang, S.-J. Chen, L. Zhang, L.-X. You, Z. Wang, Y. Liu, C.-Y. Lu, X. Jiang, X. Ma, Q. Zhang, T.-Y. Chen,  and J.-W. Pan, Phys. Rev. X 6, 011024 (2016).
15. M. Curty, F. Xu, W. Cui, C. C. W. Lim, K. Tamaki,  and H.-K. Lo, Nat. Commun. 5, 3732 (2014).
16. C. C. W. Lim, M. Curty, N. Walenta, F. Xu,  and H. Zbinden, Phys. Rev. A 89, 022307 (2014a).
17. C. C. W. Lim, B. Korzh, A. Martin, F. Bussières, R. T. Thew,  and H. Zbinden, Appl. Phys. Lett. 105, 221112 (2014b).
18. P. González, L. Rebón, T. Ferreira da Silva, M. Figueroa, C. Saavedra, M. Curty, G. Lima, G. B. Xavier,  and W. A. T. Nogueira, Phys. Rev. A 92, 022337 (2015).
19. W.-Y. Liang, M. Li, Z.-Q. Yin, W. Chen, S. Wang, X.-B. An, G.-C. Guo,  and Z.-F. Han, Phys. Rev. A 92, 012319 (2015).
20. T. Ferreira da Silva, G. C. do Amaral, G. B. Xavier, G. P. Temporão,  and J. P. von der Weid, IEEE J. Sel. Top. Quantum Electron. 21, 159 (2015).
21. C. C. W. Lim, N. Walenta, M. Legré, N. Gisin,  and H. Zbinden, IEEE J. Sel. Top. Quantum Electron. 21, 192 (2015).
22. B. Korzh, N. Walenta, T. Lunghi, N. Gisin,  and H. Zbinden, Appl. Phys. Lett. 104, 081108 (2014).
23. N. Walenta, A. Burg, D. Caselunghe, J. Constantin, N. Gisin, O. Guinnard, R. Houlmann, P. Junod, B. Korzh, N. Kulesza, M. Legré, C. C. W. Lim, T. Lunghi, L. Monat, C. Portmann, M. Soucarros, R. T. Thew, P. Trinkler, G. Trolliet, F. Vannel,  and H. Zbinden, New J. Phys. 16, 013047 (2014).
24. B. Korzh, C. C. W. Lim, R. Houlmann, N. Gisin, M. J. Li, D. Nolan, B. Sanguinetti, R. Thew,  and H. Zbinden, Nat. Photonics 9, 163 (2015).
25. C.-H. F. Fung and H.-K. Lo, Phys. Rev. A 74, 042342 (2006).
26. K. Tamaki, M. Curty, G. Kato, H.-K. Lo,  and K. Azuma, Phys. Rev. A 90, 052314 (2014).
27. J. Martínez-Mateo, C. Pacher, M. Peev, A. Ciurana,  and V. Martin, Quantum Inf. Comput. 15, 0453 (2015).
28. W.-Y. Hwang, Phys. Rev. Lett. 91, 57901 (2003).
29. H.-K. Lo, X. Ma,  and K. Chen, Phys. Rev. Lett. 94, 230504 (2005).
30. X.-B. Wang, Phys. Rev. Lett. 94, 230503 (2005).
31. Note that this does not include the information leakage due to error verification.
32. X. Sun, S. Zhang, Y. Feng,  and M. Ying, Phys. Rev. A 65, 044306 (2002).
33. Y. Zhao, B. Qi,  and H.-K. Lo, Phys. Rev. A 77, 052327 (2008b).
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minumum 40 characters