Home > Research > Publications & Outputs > On the private key capacity of the M-Relay pair...

Electronic data

  • relay-oblivious2

    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.52 MB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

On the private key capacity of the M-Relay pairwise independent network

Research output: Contribution to journalJournal article

Published
Close
<mark>Journal publication date</mark>07/2016
<mark>Journal</mark>IEEE Transactions on Information Theory
Issue number7
Volume62
Number of pages13
Pages (from-to)3831-3843
Publication statusPublished
Early online date17/05/16
Original languageEnglish

Abstract

We study the problem of private key generation in a cooperative pairwise independent network (PIN), with M + 2 terminals (Alice, Bob, and M relays), M ≥ 2. In the PIN, the correlated source observed by every pair of terminals is independent of the sources observed by any other pairs of terminals. Moreover, all terminals can communicate with each other over a public channel, which is also observed by Eve, noiselessly. The objective is to generate a private key between Alice and Bob with the help of the M relays; such a private key needs to be protected not only from Eve but also from all relays. A single-letter expression for the private key capacity of this PIN model is obtained, where the achievability part is established by proposing a random binning (RB)-based key generation algorithm, and the converse part is established by deriving upper bounds of M enhanced source models. Next, we consider a cooperative wireless network and use the estimates of fading channels to generate private keys. It has been shown that the proposed RB key generation algorithm can achieve a multiplexing gain of M - 1, which is an improvement compared with the existing XOR algorithm, whose achievable multiplexing gain is IM/2J.

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.