Visible to the public Wireless Information-Theoretic Security

TitleWireless Information-Theoretic Security
Publication TypeJournal Article
Year of Publication2008
AuthorsBloch, M., Barros, J., Rodrigues, M. R. D., McLaughlin, S. W.
JournalIEEE Transactions on Information Theory
Date Publishedjun
Keywordsaverage secure communication, channel coding, channel state information, Communication system security, data privacy, Data security, Fading, fading channels, Human Behavior, imperfect channel state information, Information analysis, Information security, information theoretic security, information-theoretic security, low-density parity-check (LDPC) codes, message protection, Metrics, multilevel coding, optimized low-density parity-check codes, outage probability, parity check codes, policy-based governance, privacy, Privacy Amplification, private key cryptography, probability, protection, pubcrawl, quasi static fading channel, Resiliency, Scalability, secrecy capacity, secret key agreement, secret key generation, secure communication protocol, telecommunication security, Wireless application protocol, wireless channel, wireless channels, Wireless Information-Theoretic Security
AbstractThis 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.
Citation Keybloch_wireless_2008