• DocumentCode
    3465230
  • Title

    A remark on secret-key generation over correlated fading channels

  • Author

    Khisti, Ashish ; Diggavi, Suhas N.

  • Author_Institution
    ECE Dept., Univ. of Toronto, Toronto, ON, Canada
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    864
  • Lastpage
    868
  • Abstract
    We study secret-key agreement with public discussion over a flat-fading wiretap channel model. The fading gains are correlated across the receivers and sampled independently at each time. Perfect receiver channel state information (CSI) is assumed, whereas a noisy CSI of the main channel is also available to the transmitter. We propose lower and upper bounds on the capacity. Our lower bound is achieved by a coding scheme that involves a separate binning of the receiver CSI sequence and its channel output sequence. In general it improves upon the joint-binning schemes considered in earlier works. Our upper and lower bounds coincide, establishing the capacity, when either the transmitter has no CSI or when the channel gains of the legitimate receiver and the eavesdropper are statistically independent.
  • Keywords
    fading channels; radio receivers; CSI; channel state information; correlated fading channels; flat-fading wiretap channel; receivers; secret-key generation; Encoding; Fading; Receivers; Security; Transmitters; Upper bound; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    GLOBECOM Workshops (GC Wkshps), 2011 IEEE
  • Conference_Location
    Houston, TX
  • Print_ISBN
    978-1-4673-0039-1
  • Electronic_ISBN
    978-1-4673-0038-4
  • Type

    conf

  • DOI
    10.1109/GLOCOMW.2011.6162578
  • Filename
    6162578