Lower and upper bounds on the secret-key rate for quantum key distribution protocols using one-way classical communication

Physical Review Letters

Volumn 95, Issue 8, 2005, Pages

  Kraus, B ^a   Gisin, N ^a   Renner, R ^b  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER AND UPPER BOUNDS; QUANTUM KEY DISTRIBUTION (QKD) PROTOCOLS; TWO-QUBIT DENSITY OPERATORS;

CRYPTOGRAPHY; ENTROPY; NETWORK PROTOCOLS;

QUANTUM THEORY;

EID: 27144544067     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.95.080501     Document Type: Article

References (21)

1. N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden, Rev. Mod. Phys. 74, 145 (2002). RMPHAT 0034-6861 10.1103/RevModPhys.74.145
2. http://www.idquantique.com;
3. http://www.magiqtech.com.
4. P.W. Shor and J. Preskill, Phys. Rev. Lett. 85, 441 (2000). PRLTAO 0031-9007 10.1103/PhysRevLett.85.441
5. H.-K. Lo, Quantum Inf. Comput. QICUAW 1533-7146 1, 81 (2001).
6. K. Tamaki, M. Koashi, and N. Imoto, Phys. Rev. Lett. 90, 167904 (2003). PRLTAO 0031-9007 10.1103/PhysRevLett.90.167904
7. On the other hand, the security proofs presented in D. Mayers, Advances in Cryptology-CRYPTO 1996, Lecture Notes in Computer Science Vol. 1109 (Springer, New York, 1996), p. 343 and
8. E. Biham, M. Boyer, P.O. Boykin, T. Mor, and V. Roychowdhury, in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (ACM Press, New York, 2000), p. 715, are based on information-theoretic methods.
9. A.K. Ekert, Phys. Rev. Lett. 67, 661 (1991). PRLTAO 0031-9007 10.1103/PhysRevLett.67.661
10. C.H. Bennett, G. Brassard, and N.D. Mermin, Phys. Rev. Lett. 68, 557 (1992). PRLTAO 0031-9007 10.1103/PhysRevLett.68.557
11. C.H. Bennett and G. Brassard, in Proceedings of the IEEE International Conference on Computer Systems and Signal Processing (IEEE, New York, 1984), p. 175.
12. D. Bruss, Phys. Rev. Lett. 81, 3018 (1998); PRLTAO 0031-9007 10.1103/PhysRevLett.81.3018
13. H. Bechmann-Pasquinucci and N. Gisin, Phys. Rev. A PLRAAN 1050-2947 59, 4238 (1999). 10.1103/PhysRevA.59.4238
14. C.H. Bennett, Phys. Rev. Lett. 68, 3121 (1992). PRLTAO 0031-9007 10.1103/PhysRevLett.68.3121
15. R. Renner and R. König, in Proceedings of Theory of Cryptography Conference 2005, Lecture Notes in Computer Science Vol. 3378 (Springer, New York, 2005).
16. R. König, M. Maurer, and R. Renner, quant-ph/0305154.
17. M. Christandl, R. Renner, and A. Ekert, quant-ph/0402131).
18. R. Renner and S. Wolf, in Proceedings of ASIACRYPT 2005, Lecture Notes in Computer Science (Springer-Verlag, New York, 2005), p. 233.
19. For details see R. Renner, N. Gisin, and B. Kraus, Phys. Rev. A PLRAAN 1050-2947 72, 012332 (2005). 10.1103/PhysRevA.72.012332
20. A similar upper bound has been presented in I. Devetak and A. Winter, Proc. R. Soc. A PRLAAZ 0080-4630 461, 207 (2005).
21. Ch. Fuchs, R.B. Griffiths, Ch.Sh. Niu, A. Peres, and N. Gisin, Phys. Rev. A PLRAAN 1050-2947 56, 1163 (1997). 10.1103/PhysRevA.56.1163