Secret Keys from Channel Noise

  • Hadi Ahmadi
  • Reihaneh Safavi-Naini
Conference paper

DOI: 10.1007/978-3-642-20465-4_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6632)
Cite this paper as:
Ahmadi H., Safavi-Naini R. (2011) Secret Keys from Channel Noise. In: Paterson K.G. (eds) Advances in Cryptology – EUROCRYPT 2011. EUROCRYPT 2011. Lecture Notes in Computer Science, vol 6632. Springer, Berlin, Heidelberg


We study the problem of unconditionally secure Secret Key Establishment (SKE) when Alice and Bob are connected by two noisy channels that are eavesdropped by Eve. We consider the case that Alice and Bob do not have any sources of initial randomness at their disposal. We start by discussing special cases of interest where SKE is impossible and then provide a simple SKE construction over binary symmetric channels that achieves some rates of secret key. We next focus on the Secret Key (SK) capacity and provide lower and upper bounds on this capacity. We prove the lower bound by proposing a multi-round SKE protocol, called the main protocol. The main protocol consists of an initialization round and the repetition of a two-round SKE sub-protocol, called the basic protocol. We show that the two bounds coincide when channels do not leak information to the adversary. We apply the results to the case that communicants are connected by binary symmetric channels.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

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

Personalised recommendations