Key Generation Using External Source Excitation: Capacity, Reliability, and Secrecy Exponent

被引:26
作者
Chou, Tzu-Han [1 ]
Draper, Stark C. [1 ]
Sayeed, Akbar M. [1 ]
机构
[1] Univ Wisconsin, Dept Elect & Comp Engn, Madison, WI 53706 USA
基金
美国国家科学基金会;
关键词
Channel sounding; error exponent; multipath randomness; privacy amplification; public discussion; reciprocal wireless channel; secrecy exponent; secret key capacity; secret key generation; INFORMATION; AGREEMENT; CHANNELS;
D O I
10.1109/TIT.2011.2176311
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS, a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key capacity for such systems with one-way public messaging. We then characterize a tradeoff between the secret key rate and exponential bounds on the probability of key agreement failure and on the secrecy of the key generated. We find that there is a fundamental tradeoff between reliability and secrecy. We then explore this framework within the context of reciprocal wireless channels. In this setting, the users transmit pre-arranged excitation signals to each other. When the fading is Rayleigh, the observations of the users are jointly Gaussian sources. We show that an on-off excitation signal with an signal-to-noise ratio (SNR)-dependent duty cycle achieves the secret key capacity of this system. Furthermore, we characterize a fundamental metric-minimum energy per key bit for reliable key generation-and show that in contrast to conventional AWGN channels, there is a nonzero threshold SNR that achieves the minimum energy per key bit. The capacity achieving on-off excitation signal achieves the minimum energy per key bit at any SNR below the threshold. Finally, we build off our error exponent results to investigate the energy required to generate a key using a finite block length. Again we find that on-off excitation signals yield an improvement when compared to constant excitation signals. In addition to Rayleigh fading, we analyze the performance of a system based on binary channel phase quantization.
引用
收藏
页码:2455 / 2474
页数:20
相关论文
共 30 条
[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]  
Balanis CA., 1997, ANTENNA THEORY ANAL
[3]   Generalized privacy amplification [J].
Bennett, CH ;
Brassard, G ;
Crepeau, C ;
Maurer, UM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) :1915-1923
[4]   PRIVACY AMPLIFICATION BY PUBLIC DISCUSSION [J].
BENNETT, CH ;
BRASSARD, G ;
ROBERT, JM .
SIAM JOURNAL ON COMPUTING, 1988, 17 (02) :210-229
[5]   Wireless information-theoretic security [J].
Bloch, Matthieu ;
Barros, Joao ;
Rodrigues, Miguel R. D. ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2515-2534
[6]  
Chou T., 2009, P WORKSH INF THEOR A
[7]  
Chou T.-H., 2009, P IEEE INT S INF THE
[8]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[9]  
Gallager R.G., 1979, LIDSP937 MIT
[10]  
Gallager R. G., 1968, Information Theory and Reliable Communication, V2