Secret Key Establishment over Noisy Channels

  • Hadi Ahmadi
  • Reihaneh Safavi-Naini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6888)


This paper provides a reflective overview of the research published in [3,4], which introduces a new realistic scenario for information theoretically secure key establishment. The scenario is when two parties are communicating over “noisy” channels that are eavesdropped by other parties in the environment. We define the secret key capacity as the highest achievable secret key rate, i.e., the highest number of secret key bits that the two parties can share on average per use of the channel. We study the above problem in two settings when the two parties have, or do not have, access to sources of local randomness. In each case, we derive lower and upper bounds on the SK capacity and derive the capacity for special cases. We also compare the bounds in the two settings and discuss the role of local randomness in increasing key rate.


Channel Noise Noisy Channel Public Channel Local Randomness Secrecy Capacity 
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., Csiszár, I.: Common randomness in information theory and cryptography. Part I: secret sharing. IEEE Transaction Information Theory 39, 1121–1132 (1993)CrossRefzbMATHGoogle Scholar
  2. 2.
    Ahlswede, R., Cai, N.: Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 258–275. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Ahmadi, H., Safavi-Naini, R.: Secret key establishment over a pair of independent broadcast channels. In: International Symposium Information Theory and its Application, pp. 185–190 (2010) Full version on the arXiv preprint server, arXiv:1001.3908Google Scholar
  4. 4.
    Ahmadi, H., Safavi-Naini, R.: Secret keys from channel noise. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 266–283. Springer, Heidelberg (2011); Full version on the Cryptology ePrint Archive: Report 2011/063 CrossRefGoogle Scholar
  5. 5.
    Csiszár, I., Körner, J.: Broadcast channels with confidential messages. IEEE Transaction Information Theory 24, 339–348 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transaction Information Theory 22, 644–654 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Khisti, A., Diggavi, S., Wornell, G.: Secret key generation with correlated sources and noisy channels. In: IEEE International Symposium Information Theory, pp. 1005–1009 (2008)Google Scholar
  8. 8.
    Körner, J., Marton, K.: Comparison of two noisy channels. Transactions of the Hungarian Colloquium on Information Theory, 411–423 (1977)Google Scholar
  9. 9.
    Maurer, U.: Secret key agreement by public discussion from common information. IEEE Transaction Information Theory 39, 733–742 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Prabhakaran, V., Eswaran, K., Ramchandran, K.: Secrecy via sources and channels - a secret key - secret message rate trade-off region. In: IEEE International Symposium Information Theory, pp. 1010–1014 (2008)Google Scholar
  11. 11.
    Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal 28, 656–715 (1948)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Wyner, A.D.: The wire-tap channel. Bell System Technical Journal 54, 1355–1367 (1975)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hadi Ahmadi
    • 1
  • Reihaneh Safavi-Naini
    • 1
  1. 1.Department of Computer ScienceUniversity of CalgaryCanada

Personalised recommendations