Wireless information-theoretic security

被引:1478
作者
Bloch, Matthieu [1 ,2 ]
Barros, Joao [3 ,4 ]
Rodrigues, Miguel R. D. [3 ,4 ]
McLaughlin, Steven W. [1 ,2 ]
机构
[1] GT CNRS UMR 2958, Metz, France
[2] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
[3] Univ Porto, Fac Ciencias, Inst Telecommun, P-4169007 Oporto, Portugal
[4] Univ Porto, Fac Ciencias, Dept Comp Sci, P-4169007 Oporto, Portugal
基金
美国国家科学基金会; 美国安德鲁·梅隆基金会;
关键词
information-theoretic security; low-density parity-check (LDPC) codes; secrecy capacity; secret key agreement; wireless channels;
D O I
10.1109/TIT.2008.921908
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.
引用
收藏
页码:2515 / 2534
页数:20
相关论文
共 54 条
[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]  
ASSCHE GV, 2004, IEEE T INFORM THEORY, V50, P394
[3]  
Aziz A., 1993, IEEE PERSONNAL COMMU, V1, P25
[4]   Secrecy capacity of wireless channels [J].
Barros, Joao ;
Rodrigues, Miguel R. D. .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :356-+
[5]  
Bennett C. H., 1984, P IEEE INT C COMP SY, DOI DOI 10.1016/J.TCS.2014.05.025
[6]   Generalized privacy amplification [J].
Bennett, CH ;
Brassard, G ;
Crepeau, C ;
Maurer, UM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) :1915-1923
[7]   Fading channels: Information-theoretic and communications aspects [J].
Biglieri, E ;
Proakis, J ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2619-2692
[8]   LDPC-based Gaussian key reconciliation [J].
Bloch, Matthieu ;
Thangaraj, Andrew ;
McLaughlin, Steven W. ;
Merolla, Jean-Marc .
2006 IEEE INFORMATION THEORY WORKSHOP, 2006, :116-+
[9]  
BRASSARD G, 1993, ADV CRYPTOLOGY EUROC, P411
[10]   Linking information reconciliation and privacy amplification [J].
Cachin, C ;
Maurer, UM .
JOURNAL OF CRYPTOLOGY, 1997, 10 (02) :97-110