Home > Research > Publications & Outputs > Group secret key generation in wireless networks

Electronic data

  • Group_Key

    Rights statement: ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 4.76 MB, PDF document

Links

Text available via DOI:

View graph of relations

Group secret key generation in wireless networks: algorithms and rate optimization

Research output: Contribution to journalJournal article

Published
<mark>Journal publication date</mark>8/08/2016
<mark>Journal</mark>IEEE Transactions on Information Forensics and Security
Issue number8
Volume11
Number of pages16
Pages (from-to)1831-1846
Publication statusPublished
Early online date13/04/16
Original languageEnglish

Abstract

This paper investigates group secret key generation problems for different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A new group key generation strategy with low complexity is proposed, which combines the well-established point-to-point pairwise key generation technique, the multisegment scheme, and the one-time pad. In particular, this group key generation process is studied for three types of communication networks: 1) the three-node network; 2) the multinode ring network; and 3) the multinode mesh network. Three group key generation algorithms are developed for these communication networks, respectively. The analysis shows that the first two algorithms yield optimal group key rates, whereas the third algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address the time allocation problem in the channel estimation step to maximize the group key rates. This non-convex max-min time allocation problem is first reformulated into a series of geometric programming, and then, a single-condensation-method-based iterative algorithm is proposed. Numerical results are also provided to validate the performance of the proposed key generation algorithms and the time allocation algorithm.

Bibliographic note

©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.