A unified framework for key agreement over wireless fading channels

2009 IEEE Information Theory Workshop, ITW 2009

Volumn , Issue , 2009, Pages 100-104

  Lai, Lifeng ^a   Poor, H Vincent ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CHANNEL MODEL; COHERENCE TIME; HIGH SNR; KEY AGREEMENT; SOURCE MODELS; TIME VARYING CHANNEL; UNIFIED FRAMEWORK; WIRELESS FADING CHANNELS;

ASYMPTOTIC ANALYSIS; FADING (RADIO); INFORMATION THEORY;

FADING CHANNELS;

EID: 76249088301     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2009.5351257     Document Type: Conference Paper

References (8)

1. Y. Liang, H. V. Poor, and S. Shamai (Shitz), Information Theoretic Security. Dordrecht, The Netherlands: Now Publishers, 2009.
2. P. K. Gopala, L. Lai, and H. El Gamal, .On the secrecy capacity of fading channels,. IEEE Trans. Inf. Theory, vol.54, pp. 4687-4698, Oct. 2008.
3. Y. Liang, H. V. Poor, and S. Shamai (Shitz), .Secure communication over fading channels,. IEEE Trans. Inf. Theory, vol.54, pp. 2470-2492, June 2008.
4. R. Wilson, D. Tse, and R. A. Scholtz, .Channel identification: Secret sharing using reciprocity in ultrawideband channels,. IEEE Trans. Inf. Forensics and Security, vol.2, pp. 364.375, Sept. 2007.
5. R. Ahlswede and I. Csiszár, .Common randomness in information theory and cryptography, Part I: Secret sharing,. IEEE Trans. Inf. Theory, vol.39, pp. 1121-1132, July 1993.
6. M. Médard, .The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel,. IEEE Trans. Inf. Theory, vol.46, pp. 933-946, May 2000.
7. B. Hassibi and B. M. Hochwald, .How much training is needed in multiple-antenna wireless links?,. IEEE Trans. Inf. Theory, vol.49, pp. 951-963, Apr. 2003.
8. I. Csiszár and P. Narayan, .Common randomness and secret key generation with a helper,. IEEE Trans. Inf. Theory, vol.46, pp. 344.366, Mar. 2000.