Information-Theoretically Secret Key Generation for Fading Wireless Channels

被引:316
作者
Ye, Chunxuan [1 ]
Mathur, Suhas [2 ]
Reznik, Alex [1 ]
Shah, Yogendra [1 ]
Trappe, Wade [2 ]
Mandayam, Narayan B. [2 ]
机构
[1] InterDigital Commun LLC, King Of Prussia, PA 19406 USA
[2] Rutgers State Univ, WINLAB, N Brunswick, NJ 08902 USA
基金
美国国家科学基金会;
关键词
Information-theoretic security; key generation; PHY layer security; UNAUTHENTICATED PUBLIC CHANNELS; BINARY SOURCES; AGREEMENT; AUTHENTICATION; RECONCILIATION; CRYPTOGRAPHY; COMPRESSION;
D O I
10.1109/TIFS.2010.2043187
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time, and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate both proposed protocols through experimentations using a customized 802.11a platform, and show for the typical WiFi channel that reliable secret key establishment can be accomplished at rates on the order of 10 b/s.
引用
收藏
页码:240 / 254
页数:15
相关论文
共 62 条
[1]  
*3GPP, 2005, 25212 3GPP TS
[2]   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
[3]  
[Anonymous], 2001, EXERCISES PROBABILIT
[4]  
[Anonymous], 2001, WIRELESS COMMUNICATI
[5]  
[Anonymous], 2005, Wireless Communications
[6]  
[Anonymous], 80211A IEEE 11
[7]  
[Anonymous], P 1 JOINT WORKSH INF
[8]   Wireless secret key generation exploiting reactance-domain scalar response of multipath fading channels [J].
Aono, T ;
Higuchi, K ;
Ohira, T ;
Komiyama, B ;
Sasaoka, H .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2005, 53 (11) :3776-3784
[9]   Robust Key Generation from Signal Envelopes in Wireless Networks [J].
Azimi-Sadjadi, Babak ;
Kiayias, Aggelos ;
Mercado, Alejandra ;
Yener, Bulent .
CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2007, :401-+
[10]  
Bennett C. H., 1992, Journal of Cryptology, V5, P3, DOI 10.1007/BF00191318