Unconditionally Secure Authentication in Quantum Key Distribution

Sufyan T. Faraj Al-Janabi*
Associate Prof .,College of IT ,Nahrain University ,Al-Jaderiya ,Baghdad ,Iraq
Periodicity:January - March'2007
DOI : https://doi.org/10.26634/jse.1.3.720

Abstract

Quantum key distribution (QKD) is a method using some properties of quantum mechanics to create a secret shared cryptographic key even if an eavesdropper has access to unlimited computational power. All QKD protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-the-middle attacks. This paper studies QKD from this point of view, emphasizing the necessity and sufficiency of using unconditionally secure authentication in QKD. In this work, a new technique of using unconditionally secure authentication is proposed for quantum cryptosystems. This technique is based on a hybrid of normal application of authentication codes and the so-called “counter-based” authentication method such that to achieve a better trade off between security and efficiency (in terms of the required size of initially shared secret data). Based on this strategy, an authenticated version of a typical QKD protocol (the well-known BB84 protocol) is described. Some advantages of our protocol in comparison to other proposals are also highlighted.

Keywords

Cryptography, Quantum, Authentication, Universal Hashing, Key Distribution

How to Cite this Article?

Al-Janabi, S. T. F. (2007). Unconditionally Secure Authentication in Quantum Key Distribution. i-manager’s Journal on Software Engineering, 1(3), 30-42. https://doi.org/10.26634/jse.1.3.720

References

[1]. M.I. Khon ond M. 5her, "Protocols for secure quantum transmission: o review of recent developments," Pakistan J. of information and Technology, Vol, 2, No. 3, pp. 265- 276, 2003.
[2]. 5.J. Lomonoco, "A quick gionce of quontum cryptogrophy," Dept. of Comput. Sci. and Elect. Engr., Univ. of Maryland Baltimore County, quont-phi98 I 1056, Nov. I 998.
[3], C.H. Bennett ond G. Brossord, "Quontum cryptogrophy: public key distribution ond coin tossing," international Conference on Computers, Systems and Signal Processing, indio, pp. I 75- I 79, Dec. I 984.
[4]. D. Mayers, "Unconditional security in quantum cryptogrophy," J. of the ACM, Vol, 48, No. 3, pp.351- 406, May 2001 .
[5]. D. Goftesmon, H-K. Lo, N. Lufkenhous, ond J. Preskiii, "5ecurity of quontum key distribution with imperfect devices," quont-ph/ 02 I 2066, Dec, 2002.
[6]. D. Goftesmon ond H-K. Lo, "Proof of security of quontum key distribution with two-woy ciossicol communicotions," quont-ph/0 I 05 I 2 I , 5ept. 2005.
[7]. M. Peev, M. Nolie, O. Mourhordt, T. Lorunser, M. 5udo, A. Poppa, R. Ursin, A. Fedrizzi, ond A. Zeiiinger, "A novel protocol-authenticotion oigorithm ruling out o mon-in- the-middle otfock in quontum cryptogrophy," quont- ph/0407 I 31, June 2005,
[8]. C.H. Bennett, F. Bessette, G. Brossord, L. 5olvoil, ond J. 5moiln, "Experimentoi quontum cryptogrophy," J. of Cryptology, Vol. 5, pp. 3-28, I 99 I . .
[9]. J. Ceder|of, "Authenticotion in quontum key growing," M. Sc. Thesis, Department of Applied Mathematics, LinkopingsUniversity, 5weden, June 2005.
[10]. K.G. Poterson, F. Piper, ond R. 5chock, "Why quontum cryptogrophy," Department of Mathematics, Univ. of London, UK, quont-ph/ 0406 I 47, 5ept. 2005.
[1 I ]. N. Lutkenhous, "Est/motes for procticoi quontum cryptogrophy," Phys. Rev. , Vol, A59 , pp, 3301-33 I 9 , I 999 .
[12]. U.M. Mourer, "5ecret key ogreement by public discussion from common info,motion," /EEE Trans. on lnformationTh., Vol. 39 , pp. 733-742, I 993.
[13]. G. Brossord ond L. 5olvoli, "5ecret-key reconciiiotion by public discussion, " Advances in Cryptology:EUROCRYPT93, Lect. Notes in Comput, 5ci., Vol. 765, pp. 410-423, I 994.
[14]. W.T. Burner, 5.K. Lomoreoux, J.R. Torgerson, G.H. Nickel, C.H. Donohue ond C.G. Peterson, "Fost, efficient error reconciliotion for quontum cryptogrophy," Univ. of California, Los Alamos National Lab. , quont- ph/0203096, Aug. 2005.
[15]. C.H. Bennett, G. Brossord, ond J-M. Roberts, "Privocy omplificotion by public discussion," Siam J. Comput. , Vol.1 7, No. 2, pp. 2 I 0-229 , April 1988.
[16]. C.H. Bennett, G. Brossord, C. Crepeou, ond U.Maurer, "Generalized privacy ampllfication," /EEE Trans. on lnformationTh., Vol, 41, pp. I 9 I 5- I 923, I 995.
[17]. J.L Carter and M.N. Wegman, "Universal classes of hash funct!ons," J. Comput. and System. Sci. , VoL 18, pp. I 43- I 54, I 979.
[18]. M.N. Wegman and J.L Carter, "New hash functions and their use in authentication and set equality," J. Comput. and System. Sci. , Vol, 22, pp, 256-279, 1981 ,
[19]. D.R. Stinson, "Universal hashing and authentication codes," Aavances in Crypto/ogy-CRYPTO'91, Lect. Notes in Comput, ScL, Vol, 576, pp, 74-85, I 992,
[20]. M. Alici and D.R. Stinson, "Universal hashing and multiple authent!cation," Advances In CryptoIogy- CRYPTO'96, Lect, Notes in Comput. sci,, VoL I 109, pp. 16- 30, I 996.
[2 I ]. J.L. Massey, Cryptography- a selectlve survey, in "Digital Communications", E, Biglieri and G, Prati, eds., North-Holland, pp. 3-2 I , I 986 ,
[22]. D.R. Stinson, "On the connections between universal hashing, combinatorial designs and error- correcting codes," Congressus Numerant\um, VoL I I 4, I 996.
[23]. R. Taylor, "Near optimal unconditionally secure authentication," EUROCRYPT 94, Lect, Notes in Comput. Sci, , VoL 950, pp. 244-253, I 995 .
[24]. G. Gilbert and M. Hamrick, "Practical quantum cryptography: a comprehensive analysis (part one)," M/TRE Technlcal Report, USA, Sept, 2000,
[25]. M. Dusek, O. Haderka, M. Hendrych, and R. Myska, "Quantum identification system,"Phys. Rev. , Vol, A60, pp. I 49- I 57, I 999.
[26]. S.T. Faraj, F. AI-Naima, and S.Y. Ameen, "Quantum cryptographic key distribution in multiple-access networks," Proceeding of 16# /F/P World Computer Congress, China, August 2000,
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.