Key Distribution Protocol Based on Noisy Channel and Error Detecting Codes

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2052)


Secret key agreement based on noisy channel connecting parties and on public discussion has been considered in 1-4 for asymptotic case. Extension of the information-theoretically secure key sharing concept to non- asymptotic case was given in [5]. In the last paper several channel transform protocols (corresponding to different algorithms of public discussion) were presented. Unfortunately the efficiency of these protocols was very low in comparison with asymptotic key capacity found in [1]. The reason of this was that these protocols do not use a redundancy efficiently. One of the considered protocols (the socalled advantage to the main channel primitive) exploits a repetition of binary symbols only. It may be much better to use linear error detecting codes, that is just a subject of consideration in the current paper. We regain the main formulas to compute Renyi entropy which is necessary to bound the information about the final key leaking to an eavesdropper after execution of such modificated protocol. The use of this protocol causes an increase in the key-rate by several times, that is very important in practical implementations of key sharing procedures.


Public Discussion Forward Error Correction Information Symbol Noisy Channel Privacy Amplification 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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 1: Secret Sharing. IEEE Trans. on IT, Vol. 39.4 (1993) 1121–1132zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Maurer, U.: Secret Key Agreement by Public Discussion Based on Common Information. IEEE Trans. on IT. Vol. 39. (May 1993) 733–742zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Maurer, U.: Protocols for Secret Key Agreement by Public Discussion Based on Common Information. Advances in Cryptology — CRYPTO’ 92, Lecture Notes in Computer Science, Vol. 740. Springer-Verlag, Berlin (1993) 461–470Google Scholar
  4. 4.
    Maurer, U.: Linking Information Reconciliation and Privacy Amplification. J. Cryptology. 10 (1997) 97–110zbMATHCrossRefGoogle Scholar
  5. 5.
    Korjik, V., Yakovlev, V., Sinuk, A.: Performance Evaluation of different Secret Key Agreement Protocols Based on Noisy Channels. ICCI’2000, KuwaitGoogle Scholar
  6. 6.
    Scheier, B.: Applied Cryptography. J. Wiley (1994)Google Scholar
  7. 7.
    Klove, T., Korjik, V.: Error Detecting Codes. Kluwer (1995)Google Scholar
  8. 8.
    Korjik, V., Yakovlev, V.: Capacity of Communication Channel with Inner Random Coding. Problems of Information Transmission, Vol. 28.4 (1992) 317–325MathSciNetGoogle Scholar
  9. 9.
    Bennett, C., Brassard, G., Crepeau, C., Maurer U.: Generalized Privacy Amplification. IEEE Trans. on Inform. Theory. Vol. 41.6 (1995) 1915–1923zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Korjik, V., Morales Luna, G, Balakirsky, V.: Enhanced Privacy Amplification Theorem for Noisy Main Channel (submitted for Crypto’2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Personalised recommendations