Jamming-Resistant Frequency Hopping System with Secret Key Generation from Channel Observations

被引:0
作者
Liu, Chia-Yu [1 ]
Hong, Y. -W. Peter [1 ]
Lin, Pim-Hsun [2 ]
Jorswieck, Eduard A. [2 ]
机构
[1] Natl Tsing Hua Univ, Inst Commun Engn, Hsinchu, Taiwan
[2] Tech Univ Dresden, Fac Elect & Comp Engn, Dresden, Germany
来源
2016 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2016年
关键词
CAPACITY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work proposes a jamming-resistant frequency hopping (FH) system that utilizes local channel observations for secret key generation (SKG). FH is a spread spectrum technique used in both military and consumer wireless applications to avoid jamming attacks, but requires pre-shared secret keys among communicating terminals, say Alice and Bob, to ensure that the same FH sequence is used at both sides. In our scheme, Alice and Bob utilize local observations of the channel between them as the source of common randomness to generate the shared secret key. By gathering multiple time slots into a frame, the sequence of channels observed in each frame can be used to determine the FH sequence in the next frame. In this case, the key generation rate must be high enough to identify the FH sequence in the next frame and, thus, to sustain the operation over time. However, by further considering the data transmission, an interesting tradeoff exists between the power allocated for SKG and channel estimation in the training phase and that for communication in the data transmission phase. Given the number of FH channels and the number of channels that the adversary can jam at once, we derive the minimum pilot signal power required for sustainability and also determine the optimal power allocation between pilot and data signals that maximizes the ergodic rate between the two users. Simulations are provided to demonstrate the effectiveness of the proposed scheme.
引用
收藏
页数:5
相关论文
共 16 条
[1]   COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].
AHLSWEDE, R ;
CSISZAR, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132
[2]  
[Anonymous], 2005, P 6 ACM INT S MOB AD, DOI DOI 10.1145/1062689.1062697
[3]  
[Anonymous], 1994, Spread Spectrum Communications Handbook
[4]   A Unified Framework for Key Agreement Over Wireless Fading Channels [J].
Lai, Lifeng ;
Liang, Yingbin ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (02) :480-490
[5]   Exploiting Channel Diversity in Secret Key Generation From Multipath Fading Randomness [J].
Liu, Yanpei ;
Draper, Stark C. ;
Sayeed, Akbar M. .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (05) :1484-1497
[6]  
MAURER UM, 1993, IEEE T INFORM THEORY, V39, P733, DOI 10.1109/18.256484
[7]   Anti-Jamming Broadcast Communication using Uncoordinated Spread Spectrum Techniques [J].
Poepper, Christina ;
Strasser, Mario ;
Capkun, Srdjan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2010, 28 (05) :703-715
[8]   Secure wireless communications: Secret keys through multipath [J].
Sayeed, Akbar ;
Perrig, Adrian .
2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, :3013-+
[9]  
Wallace J., 2009, PROC IEEE INT C COMM, P1
[10]   Secret Key Agreement From Vector Gaussian Sources by Rate Limited Public Communication [J].
Watanabe, Shun ;
Oohama, Yasutada .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2011, 6 (03) :541-550