• DocumentCode
    3310226
  • Title

    New results on Secret Key Establishment over a pair of broadcast channels

  • Author

    Ahmadi, Hadi ; Safavi-Naini, Reihaneh

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB, Canada
  • fYear
    2010
  • fDate
    17-20 Oct. 2010
  • Firstpage
    191
  • Lastpage
    196
  • Abstract
    Secret Key Establishment (SKE) over a pair of independent Discrete Memoryless Broadcast Channels (DMBCs) was studied in where lower and upper bounds on the secret-key capacity were provided. In this paper, we study the above setup for two cases: (1) the DMBCs have “secrecy potential”, and (2) the DMBCs are stochastically degraded with independent channels. For (1), we propose a simple SKE protocol using the novel Interactive Channel Coding (ICC) method and prove that it achieves the lower bound. For (2), we give a simplified expression for the lower bound and prove that, when one of the legitimate parties sends only i.i.d. variables, the lower bound is tight and the capacity is achieved by a two-round protocol.
  • Keywords
    broadcast channels; channel capacity; channel coding; protocols; DMBC; ICC method; SKE; SKE protocol; independent discrete memoryless broadcast channels; interactive channel coding method; lower bounds; secret key establishment; secret-key capacity; two-round protocol; upper bounds; Channel coding; Decoding; Markov processes; Protocols; Systematics; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and its Applications (ISITA), 2010 International Symposium on
  • Conference_Location
    Taichung
  • Print_ISBN
    978-1-4244-6016-8
  • Electronic_ISBN
    978-1-4244-6017-5
  • Type

    conf

  • DOI
    10.1109/ISITA.2010.5650104
  • Filename
    5650104