-
1
-
-
0003259517
-
-
IEEE, New York
-
C. H. Bennett, G. Brassard, in Proceedings IEEE Int. Conf. on Computers, Systems and Signal Processing, Bangalore, India (IEEE, New York, 1984), pp. 175-179.
-
(1984)
Proceedings IEEE Int. Conf. on Computers, Systems and Signal Processing, Bangalore, India
, pp. 175-179
-
-
Bennett, C.H.1
Brassard, G.2
-
2
-
-
0036013605
-
-
N. Gisin, G. Ribordy, W. Tittel, H. Zbinden, Rev. Mod. Phys 74, 145 (2002)
-
(2002)
Rev. Mod. Phys
, vol.74
, pp. 145
-
-
Gisin, N.1
Ribordy, G.2
Tittel, W.3
Zbinden, H.4
-
4
-
-
34547551018
-
-
quant-ph/0411022
-
N. Gisin, G. Ribordy, H. Zbinden, D. Stucki, N. Brunner, V. Scarani, quant-ph/0411022 (2004)
-
(2004)
-
-
Gisin, N.1
Ribordy, G.2
Zbinden, H.3
Stucki, D.4
Brunner, N.5
Scarani, V.6
-
5
-
-
27644570716
-
-
D. Stucki, N. Brunner, N. Gisin, V. Scarani, H. Zbinden, Appl. Phys. Lett. 87, 194108 (2005)
-
(2005)
Appl. Phys. Lett
, vol.87
, pp. 194108
-
-
Stucki, D.1
Brunner, N.2
Gisin, N.3
Scarani, V.4
Zbinden, H.5
-
9
-
-
27144544067
-
-
B. Kraus, N. Gisin and R. Renner, Phys. Rev. Lett. 95, 080501 (2005); R. Renner, N. Gisin, B. Kraus, Phys. Rev. A 72, 012332 (2005)
-
B. Kraus, N. Gisin and R. Renner, Phys. Rev. Lett. 95, 080501 (2005); R. Renner, N. Gisin, B. Kraus, Phys. Rev. A 72, 012332 (2005)
-
-
-
-
11
-
-
7044249607
-
-
D. Gottesman, H.-K. Lo, N. Lütkenhaus, J. Preskill, Quant. Inf. Comput. 4, 325 (2004)
-
(2004)
Quant. Inf. Comput
, vol.4
, pp. 325
-
-
Gottesman, D.1
Lo, H.-K.2
Lütkenhaus, N.3
Preskill, J.4
-
12
-
-
33846355949
-
-
B. Kraus, C. Branciard, R. Renner, Phys. Rev. A 75, 012316 (2007)
-
(2007)
Phys. Rev. A
, vol.7
, Issue.5
, pp. 012316
-
-
Kraus, B.1
Branciard, C.2
Renner, R.3
-
15
-
-
0343536431
-
-
G. Brassard, N. Lütkenhaus, T. Mor, B.C. Sanders, Phys. Rev. Lett. 85, 1330 (2000)
-
(2000)
Phys. Rev. Lett
, vol.85
, pp. 1330
-
-
Brassard, G.1
Lütkenhaus, N.2
Mor, T.3
Sanders, B.C.4
-
17
-
-
85035299752
-
-
Attacks based on unambiguous state discrimination were first invented against BB84 and similar protocols: M. Dušek, M. Jahma, N. Lǔtkenhaus, Phys. Rev. A 62, 022306 (2000).
-
Attacks based on unambiguous state discrimination were first invented against BB84 and similar protocols: M. Dušek, M. Jahma, N. Lǔtkenhaus, Phys. Rev. A 62, 022306 (2000).
-
-
-
-
18
-
-
0142120515
-
-
They were generalized in: P. Raynal, N. Lütkenhaus, S.J. van Enk, Phys. Rev. A 68, 022308 (2003).
-
They were generalized in: P. Raynal, N. Lütkenhaus, S.J. van Enk, Phys. Rev. A 68, 022308 (2003).
-
-
-
-
20
-
-
34547552729
-
-
Usually, when speaking of USD measurements, the goal is to discriminate all the n possible states. Therefore the measurement has n+1 outcomes, which either identify the state unambiguously, or say that the discrimination was inconclusive, Such are in particular the USD attacks as defined in [16].
-
Usually, when speaking of USD measurements, the goal is to discriminate all the n possible states. Therefore the measurement has n+1 outcomes, which either identify the state unambiguously, or say that the discrimination was inconclusive, Such are in particular the USD attacks as defined in [16].
-
-
-
-
21
-
-
34547540439
-
-
The inconclusive result is a projection onto a subspace. If in this subspace there are still pulse sequences that are linearly independent from all the others as is the case in particular for the USD attacks under study in this paper, each of these sequences could then in turn be unambiguously discriminated with some probability
-
The inconclusive result is a projection onto a subspace. If in this subspace there are still pulse sequences that are linearly independent from all the others (as is the case in particular for the USD attacks under study in this paper), each of these sequences could then in turn be unambiguously discriminated with some probability.
-
-
-
-
22
-
-
34547512551
-
-
Note that this attack is not possible on the differential phase shift protocol [3] because there no empty pulses are used. But other USD attacks are possible, as studied in: M. Curty, L.-L. Zhang, H.-K. Lo, N. Lütkenhaus, Quant. Inf. Comput. 7, 665 (2007)
-
Note that this attack is not possible on the differential phase shift protocol [3] because there no empty pulses are used. But other USD attacks are possible, as studied in: M. Curty, L.-L. Zhang, H.-K. Lo, N. Lütkenhaus, Quant. Inf. Comput. 7, 665 (2007)
-
-
-
-
23
-
-
34547529611
-
-
If Bob's detectors have a dead time, the analysis of USD4a is more subtle, because the first non-empty pulse can be detected with the probability we have written in the main text; but the following pulse can be detected only if the first one has not been detected. This may introduce an asymmetry: the logical bit 1 may be detected more often than the logical bit 0. In the extreme case of bright pulses, the first non-empty pulse always triggers the detector, therefore only the logical bit 1 is detected. In the other extreme case, where Eve sends out a single photon, there is no asymmetry, because only one detection can take place.
-
If Bob's detectors have a dead time, the analysis of USD4a is more subtle, because the first non-empty pulse can be detected with the probability we have written in the main text; but the following pulse can be detected only if the first one has not been detected. This may introduce an asymmetry: the logical bit 1 may be detected more often than the logical bit 0. In the extreme case of bright pulses, the first non-empty pulse always triggers the detector, therefore only the logical bit 1 is detected. In the other extreme case, where Eve sends out a single photon, there is no asymmetry, because only one detection can take place.
-
-
-
-
24
-
-
34547552436
-
-
Of course, the fact that Eve forwards always a single photon can be verified by the absence of the expected coincidence counts in two or three of Bob's detectors. But this is not a serious concern: the probability of coincidence is small, and we can easily suppose that Eve sends sometimes a brighter pulse when she has a conclusive result in USD3. If she does so, she can reproduce the coincidence rates. Alice and Bob could still detect this attack by checking if the cases of coincidences are equally distributed among all possible bit and decoy sequences; but it is pointless to make such a detailed analysis here. Finally note that it may be advantageous for Eve to send other states that a single-photon state, for instance vacuum-substracted coherent states
-
Of course, the fact that Eve forwards always a single photon can be verified by the absence of the expected coincidence counts in two or three of Bob's detectors. But this is not a serious concern: the probability of coincidence is small, and we can easily suppose that Eve sends sometimes a brighter pulse when she has a conclusive result in USD3. If she does so, she can reproduce the coincidence rates. Alice and Bob could still detect this attack by checking if the cases of coincidences are equally distributed among all possible bit and decoy sequences; but it is pointless to make such a detailed analysis here. Finally note that it may be advantageous for Eve to send other states that a single-photon state, for instance vacuum-substracted coherent states.
-
-
-
-
28
-
-
34547547546
-
-
In the absence of empty decoy sequences, it never happens that three consecutive pulses are empty; two additional interferometers, checking the coherence across two and three time slots respectively, would then be enough to make USD attacks impossible
-
In the absence of empty decoy sequences, it never happens that three consecutive pulses are empty; two additional interferometers, checking the coherence across two and three time slots respectively, would then be enough to make USD attacks impossible.
-
-
-
-
30
-
-
34547499277
-
-
This is after Alice and Bob applied a random permutation on their qubit pairs and random bit-flip operations, and assuming they apply optimal error correction and privacy amplification. See [9] for details. Note that we don't consider here the possible classical preprocessing A' → A
-
This is after Alice and Bob applied a random permutation on their qubit pairs and random bit-flip operations, and assuming they apply optimal error correction and privacy amplification. See [9] for details. Note that we don't consider here the possible classical "preprocessing" A' → A.
-
-
-
-
33
-
-
26944451694
-
-
For untrusted-device scenario, see Ref. [14]; for the trusted-device scenario: A. Niederberger, V. Scarani, N. Gisin, Phys. Rev. A 71, 042316 (2005)
-
For untrusted-device scenario, see Ref. [14]; for the trusted-device scenario: A. Niederberger, V. Scarani, N. Gisin, Phys. Rev. A 71, 042316 (2005)
-
-
-
-
36
-
-
34547533300
-
-
The Holevo bound is computed here for the task of bitwise distinguishing the states. One can check that the Holevo bound remains the same if Eve tried to get information on longer strings of bits
-
The Holevo bound is computed here for the task of bitwise distinguishing the states. One can check that the Holevo bound remains the same if Eve tried to get information on longer strings of bits.
-
-
-
|