The week's pick
Reseach Article
Security Aspect OF Quantum Key Distribution
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 2 - Number 2 |
| Year of Publication: 2010 |
| Authors: Anand Sharma, Vibha Ojha, Vishal Goar |
10.5120/625-885
|
Anand Sharma, Vibha Ojha, Vishal Goar . Security Aspect OF Quantum Key Distribution. International Journal of Computer Applications. 2, 2 ( May 2010), 58-62. DOI=10.5120/625-885
Abstract
Is the newly born quantum cryptography the ultimate solution for information security? A technique needs to be both theoretically strong and practically viable. But quantum cryptography comes to naught in the latter. Unlike many of the classical cryptosystems in use today, whose security often draws on unproven assumptions about the computational complexity of mathematical problems, the security of quantum cryptography is based on—and employs—the laws of physics. The term “unconditional security”is used to emphasize the fact that it does not rely on the presumed, yet unproven hardness of somemathematical problem. In this Paper, we present the proof of the unconditional security of the BB84 protocol, as devised by Peter Shor and John Preskill [1].
References
- P. Shor and J. Preskill. Simple proof of security of the BB84 quantum key distribution protocol. Physical Review Letters, 85:441– 444, 2000.
- H. Lo and H. Chau. Unconditional security of quantum key distribution over arbitrarilylong distances. Science, 283:2050–2056, 1999.
- M. Ben-Or, M. Horodecki, D. Leung, D. Mayers, and J. Oppenheim. The universal composable security of quantum key distribution. In J. Kilian, editor, Proceedings of the Second Theory of Cryptography Conference, pages 386–406. Springer- Verlag Lecture Notes in Computer Science #3378, February 2005. Also available at http://arxiv.org/abs/quant- ph/0409078.
- A. Ekert. Quantum cryptography based on Bell’s theorem. Physical Review Letters, 67:661– 663, 1991.
- C. Bennett, G. Brassard, and D. Mermin. Quantum cryptography without Bell’s theorem. Physical Review Letters, 68:557–559, 1992.
- M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 284–293. ACM Press, 1997.
- E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6):1193– 1202, 1988.
- C. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, pages 175–179. IEEE Press, 1984.
- D. Bouwmeester, A. Ekert, and A. Zeilinger. The Physics of Quantum Information.Springer- Verlag, 2000.
- W. Hwang. Quantum key distribution with high loss: Toward global secure communication. Physical Review Letters, 91:057901, 2003.
- H. Inamori, N. L¨utkenhaus, and D. Mayers. Unconditional security of practical quantum key distribution. Technical Report quant-ph/0107017, Computing Research Repository (CoRR), 2001. Available on-line at http://arxiv.org/abs/quant-ph/0107017.
- A. Kent. Unconditionally secure bit commitment.Physical Review Letters,83:1447– 1450, 1999.
- A. Kawachi, H. Kobayashi, T. Koshiba, and R. Putra. Universal test for quantum oneway permutations. Theoretical Computer Science, 345:370–385, 2005.
- K. Ko. On some natural complete operators. TheoreticalComputerScience,37(1):1–30,1985.
- R. K¨onig, R. Renner, A. Bariska, and U. Maurer. Locking of accessible information and implications for the security of quantum cryptography. Technica lReport quantph/0512021v2, Computing Research Repository (CoRR), 2006. Available on line athttp://arxiv.org/abs/quant- ph/0512021.
- D. Bruß and C. Macchiavello. Optimal eavesdropping in cryptography with threedimensional quantum states. Physical Review Letters, 88:127901(1)–127901(4), 2002.
Index Terms
Keywords