A proof of the security of quantum key distribution (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 715-724

  Biham, Eli ^a   Boyer, Michel ^b   Boykin, P Oscar ^c   Mor, Tal ^c,d   Roychowdhury, Vwani ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c University of California   (United States)

^d ARIEL UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION ABILITY; EXTENDED ABSTRACTS; QUANTUM PHYSICS; SECURE MESSAGES;

COMPUTATION THEORY; CRYPTOGRAPHY;

MATRIX ALGEBRA; NETWORK PROTOCOLS; PROBABILITY; QUANTUM THEORY; SECURITY OF DATA; THEOREM PROVING;

BENNETT-BRASSARD PROTOCOL; QUANTUM CRYPTOGRAPHY; QUANTUM KEY DISTRIBUTION (QKD);

EID: 0033702887     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335406     Document Type: Conference Paper

References (25)

1. M. Ben-Or, Dec. 1999. Talk given in NEC workshop on quantum cryptography.
2. C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin. Experimental quantum cryptography. Jour. of Cryptology, 5: 3-28, 1992.
3. C. H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proc. of IEEE Int. Conf. on Computers, Systems and Signal Processing, pages 175-179, Bangalore, India, Dec. 1984. IEEE.
4. C. H. Bennett, G. Brassard, C. Crépeau, and D. Langlois. A quantum bit commitment scheme provably unbreakable by both parties. In Proc. of 34th Ann. Symp. on Found. of Comp. Sc., pages 362-371, Palo Alto, Ca., 1993.
5. C. H. Bennett, T. Mor, and J. A. Smolin. Parity bit in quantum cryptography. Phys. Rev. A, 54(3):2675-2684, 1996. (Pubitemid 126591946)
6. E. Biham, M. Boyer, G. Brassard, J. van de Graaf, and T. Mor. Security of quantum key distribution against all collective attacks. Quant-ph/9801022, 1998.
7. E. Biham and T. Mor. Bounds on information and the security of quantum cryptography. Phys. Rev. Lett., 79(20):4034-4037, Nov. 1997. (Pubitemid 127645147)
8. E. Biham and T. Mor. Security of quantum cryptography against collective attacks. Phys. Rev. Lett., 78:2256-2259, 1997. (Pubitemid 127651855)
9. G. Brassard, N. Lütkenhaus, T. Mor, and B. C. Sanders. Security aspects of practical quantum cryptography. Quant-ph/9801022. Accepted to Eurocrypt 2000.
10. G. Brassard, T. Mor, and B. C. Sanders. Quantum cryptography via parametric downconversion. Quant-ph/9906074, To appear in Proceedings of the Quantum Communication, Computing, and Measurement 2 (QCM'98) conference, Evanston, Ill., USA, August 1998.
11. D. Deutsch, A. K. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera. Quantum privacy amplification and the security of quantum cryptography over noisy channels. Phys. Rev. Lett., 77:2818-2821, 1996. (Pubitemid 126624149)
12. C. A. Fuchs, N. Gisin, R. B. Griffiths, C.-S. Niu, and A. Peres. Optimal eavesdropping in quantum cryptography. I. Information bound and optimal strategy. Phys. Rev. A, 56:1163-1172, 1997. (Pubitemid 127605160)
13. R. C. Gallagher. Low-density parity-check codes. The M.I.T. Press, Cambridge, Mass., 1963. Chapter 2.
14. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc., 58: 13-20, 1963.
15. H.-K. Lo. A simple proof of the unconditional security of quantum key distribution . Quant-ph/9904091.
16. H.-K. Lo and H. F. Chau. Unconditional security of quantum key distribution over arbitrarily long distances. Science, 283: 2050-2056, 1999.
17. D. Mayers. Unconditional security in quantum cryptography. Quant-ph/9802025.
18. D. Mayers. On the security of the quantum oblivious transfer and key distribution protocols. In Proceedings of Crypto'95, number 963 in LNCS, pages 124-135, 1995.
19. D. Mayers. Quantum key distribution and string oblivious transfer in noisy channel. In Proceedings of Crypto'96, number 1109 in LNCS, pages 343-357, 1996.
20. T. Mor. Reducing quantum errors and improving large scale quantum cryptography . Quant-ph/9608025.
21. P. Shor, Jan. 1999. Private communication.
22. P. Shor, Dec. 1999. Talk given in NEC workshop on quantum cryptography.
23. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26: 1484-1509, 1997.
24. S. Wiesner. Conjugate coding. Sigact News, 15: 77-88, 1983.
25. A. Yao. Security of quantum protocols against coherent measurements. In Proc. of the 26th ACM Symp. on the Theory of Computing, pages 67-75, June 1995.