Performance Evaluation of Keyless Authentication Based on Noisy Channel

  • Valery Korzhik
  • Viktor Yakovlev
  • Guillermo Morales-Luna
  • Roman Chesnokov
Part of the Communications in Computer and Information Science book series (CCIS, volume 1)


We consider a cryptographic scenario of two honest parties which share no secret key initially, but their final goal is to generate an information-theoretical secure key. In order to reach this goal they use assistance ofsome trusted center (as a satellite) that broadcasts a random string to legal users over noisy channels. An eavesdropper is able to receive also this string over another noisy channel. After an execution of the initialization phase, legal parties use discussion over noiseless public channels existing between them. The eavesdropper can intervene in the transmission and change the messages transmitted by legal parties. Thus, it is necessary to provide authentication of these messages. Otherwise the legal parties may agree a false key with the eavesdropper instead. In this paper we develop a concept of authentication based on noisy channels and present a performance evaluation of authentication procedures both for non-asymptotic and asymptotic cases.


Authentication Bhattacharyya distance error correcting codes wiretap channels 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahlswede, R., Csiszar, I.: Common randomness in information theory and cryptography — part I: Secret sharing. IEEE Transactions on Information Theory 39(4), 1121–1132 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Maurer, U.: Information-theoretically secure secret-key agreement by not authenticated public discussion. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 209–223. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  3. 3.
    Yakovlev, V., Korzhik, V., Morales-Luna, G.: Key distribution protocols based on noisy channels in presence of an active adversary: Conventional and new versions with parameter optimization. IEEE Transactions on Information Theory (Submitted to the special issue on Information Security) (2007)Google Scholar
  4. 4.
    Proakis, J.: Digital Communications, 4th edn. Mc Graw Hill Publishing Co. New York (2001)Google Scholar
  5. 5.
    Papoulis, A.: Probability, Random Variables and Stochastic Processes, 4th Rev. edn. McGraw-Hill Publishing Co. New York (2002)Google Scholar
  6. 6.
    Kailath, T.: The divergence and Bhattacharyya distance measures in signal selection. IEEE Trans. Commun. Tech. 15, 52–60 (1967)CrossRefGoogle Scholar
  7. 7.
    MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)zbMATHGoogle Scholar
  8. 8.
    Pless, V., Huffman, W.C., Brualdi, R.A.: Handbook of Coding Theory North-Holland, Amsterdam (1998)zbMATHGoogle Scholar
  9. 9.
    Peterson, W., Weldon, E.: Error-Correcting Codes 2nd edn. MIT Press, Cambridge (1972)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Valery Korzhik
    • 1
  • Viktor Yakovlev
    • 1
  • Guillermo Morales-Luna
    • 2
  • Roman Chesnokov
    • 1
  1. 1.State University of TelecommunicationsSt.PetersburgRussia
  2. 2.Computer Science DepartmentCINVESTAV-IPNMexico CityMexico

Personalised recommendations