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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (969 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents

Portland, Oregon, United States

Pages: 715 - 724

Year of Publication: 2000

ISBN:1-58113-184-4

Authors

Eli Biham	Computer Science Department, Technion, Haifa 32000, Israel
Michel Boyer	DIRO, Université de Montréal, Montréal, Canada
P. Oscar Boykin	Dept. of Electrical Engineering, UCLA, Los Angeles, CA
Tal Mor	Dept. of Electrical Engineering, UCLA, Los Angeles, CA and Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, Israel
Vwani Roychowdhury	Dept. of Electrical Engineering, College of Judea and Samaria, Ariel, Israel

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 55, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335406 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Ben-Or, Dec. 1999. Talk given in NEC workshop on quantum cryptography.
	2	Charles H. Bennett , François Bessette , Gilles Brassard , Louis Salvail , John Smolin, Experimental quantum cryptography, Journal of Cryptology, v.5 n.1, p.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 3,ith Ann. Symp. on Found. of Comp. Sc., pages 362-371, Polo 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.
	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. Mot. Bounds on information and the security of quantum cryptography. Phys. Rev. Left., 79(20):4034-4037, Nov. 1997.
	8	E. Biham and T. Mot. Security of quantum cryptography against collective attacks. Phys. Rev. Left., 78:2256-2259, 1997.
	9	G. Brassard, N. Liitkenhaus, T. Mor, and B. C. Sanders. Security aspects of practical quantum cryptography. Quant-ph/9801022. Accepted to Eurocrypt 2000.
	10	G. Brassard, T. Mot, 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. Left., 77:2818-2821, 1996.
	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.
	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	Dominic Mayers, On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.124-135, August 27-31, 1995
	19	Dominic Mayers, Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.343-357, August 18-22, 1996
	20	T. Mot. 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	Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, v.26 n.5, p.1484-1509, Oct. 1997 [doi>10.1137/S0097539795293172]
	24	Stephen Wiesner, Conjugate coding, ACM SIGACT News, v.15 n.1, p.78-88, Winter-Spring 1983 [doi>10.1145/1008908.1008920]
	25	Andrew Chi-Chih Yao, Security of quantum protocols against coherent measurements, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.67-75, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225085]

CITED BY 6

	Andris Ambainis, A new protocol and lower bounds for quantum coin flipping, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.134-142, July 2001, Hersonissos, Greece
	Andris Ambainis, A new protocol and lower bounds for quantum coin flipping, Journal of Computer and System Sciences, v.68 n.2, p.398-416, March 2004
	Takashi Mihara, Splitting information securely with entanglement, Information and Computation, v.187 n.1, p.110-122, November 25, 2003
	Hamdy S. Soliman , Mohammed Omari, Application of synchronous dynamic encryption system in mobile wireless domains, Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks, October 13-13, 2005, Montreal, Quebec, Canada
	John Watrous, PSPACE has constant-round quantum interactive proof systems, Theoretical Computer Science, v.292 n.3, p.575-588, 31 January 2003
	Anatol Slissenko, A Logic Framework for Verification of Timed Algorithms, Fundamenta Informaticae, v.62 n.1, p.29-67, January 2004