Home > Research > Publications & Outputs > The private key capacity of a cooperative pairw...

Research

Associated organisational unit

Links

Text available via DOI:

View graph of relations

The private key capacity of a cooperative pairwise-independent network

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

The private key capacity of a cooperative pairwise-independent network. / Xu, Peng; Ding, Zhiguo; Dai, Xuchu.
Information Theory (ISIT), 2015 IEEE International Symposium on. IEEE, 2015. p. 286-290 (Information Theory (ISIT), 2015 IEEE International Symposium on).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Xu, P, Ding, Z & Dai, X 2015, The private key capacity of a cooperative pairwise-independent network. in Information Theory (ISIT), 2015 IEEE International Symposium on. Information Theory (ISIT), 2015 IEEE International Symposium on, IEEE, pp. 286-290. https://doi.org/10.1109/ISIT.2015.7282462

APA

Xu, P., Ding, Z., & Dai, X. (2015). The private key capacity of a cooperative pairwise-independent network. In Information Theory (ISIT), 2015 IEEE International Symposium on (pp. 286-290). (Information Theory (ISIT), 2015 IEEE International Symposium on). IEEE. https://doi.org/10.1109/ISIT.2015.7282462

Vancouver

Xu P, Ding Z, Dai X. The private key capacity of a cooperative pairwise-independent network. In Information Theory (ISIT), 2015 IEEE International Symposium on. IEEE. 2015. p. 286-290. (Information Theory (ISIT), 2015 IEEE International Symposium on). doi: 10.1109/ISIT.2015.7282462

Author

Xu, Peng ; Ding, Zhiguo ; Dai, Xuchu. / The private key capacity of a cooperative pairwise-independent network. Information Theory (ISIT), 2015 IEEE International Symposium on. IEEE, 2015. pp. 286-290 (Information Theory (ISIT), 2015 IEEE International Symposium on).

Bibtex

@inproceedings{d02cb1baad0446ff84f8554e8966b6e9,
title = "The private key capacity of a cooperative pairwise-independent network",
abstract = "This paper studies the private key generation of a cooperative pairwise-independent network (PIN) with M + 2 terminals, where Alice and Bob wish to generate a private key under the help of the M relays, M ≥ 2; such a private key needs to be protected not only from Eve but also from individual relays simultaneously. In this PIN, the correlated source observed by every pair of terminals is independent of those sources observed by any other pair of terminals. All the terminals can communicate with each other over a public channel which is also observed by Eve noiselessly. The private key capacity of this PIN model is established, whose lower bound is obtained by proposing a novel random binning (RB) based key generation algorithm, and the upper bound is obtained based on the construction of M enhanced source models. The two bounds are shown to be exactly the same. Then, we consider a cooperative wireless network and use the estimates of fading channels to generate private keys. Compared to the existing XOR-based algorithm whose achievable multiplexing gain is ⌊M/2⌋, the proposed RB-based algorithm is demonstrated to achieve the optimal multiplexing gain M - 1.",
author = "Peng Xu and Zhiguo Ding and Xuchu Dai",
year = "2015",
month = jun,
day = "14",
doi = "10.1109/ISIT.2015.7282462",
language = "English",
series = "Information Theory (ISIT), 2015 IEEE International Symposium on",
publisher = "IEEE",
pages = "286--290",
booktitle = "Information Theory (ISIT), 2015 IEEE International Symposium on",

}

RIS

TY - GEN

T1 - The private key capacity of a cooperative pairwise-independent network

AU - Xu, Peng

AU - Ding, Zhiguo

AU - Dai, Xuchu

PY - 2015/6/14

Y1 - 2015/6/14

N2 - This paper studies the private key generation of a cooperative pairwise-independent network (PIN) with M + 2 terminals, where Alice and Bob wish to generate a private key under the help of the M relays, M ≥ 2; such a private key needs to be protected not only from Eve but also from individual relays simultaneously. In this PIN, the correlated source observed by every pair of terminals is independent of those sources observed by any other pair of terminals. All the terminals can communicate with each other over a public channel which is also observed by Eve noiselessly. The private key capacity of this PIN model is established, whose lower bound is obtained by proposing a novel random binning (RB) based key generation algorithm, and the upper bound is obtained based on the construction of M enhanced source models. The two bounds are shown to be exactly the same. Then, we consider a cooperative wireless network and use the estimates of fading channels to generate private keys. Compared to the existing XOR-based algorithm whose achievable multiplexing gain is ⌊M/2⌋, the proposed RB-based algorithm is demonstrated to achieve the optimal multiplexing gain M - 1.

AB - This paper studies the private key generation of a cooperative pairwise-independent network (PIN) with M + 2 terminals, where Alice and Bob wish to generate a private key under the help of the M relays, M ≥ 2; such a private key needs to be protected not only from Eve but also from individual relays simultaneously. In this PIN, the correlated source observed by every pair of terminals is independent of those sources observed by any other pair of terminals. All the terminals can communicate with each other over a public channel which is also observed by Eve noiselessly. The private key capacity of this PIN model is established, whose lower bound is obtained by proposing a novel random binning (RB) based key generation algorithm, and the upper bound is obtained based on the construction of M enhanced source models. The two bounds are shown to be exactly the same. Then, we consider a cooperative wireless network and use the estimates of fading channels to generate private keys. Compared to the existing XOR-based algorithm whose achievable multiplexing gain is ⌊M/2⌋, the proposed RB-based algorithm is demonstrated to achieve the optimal multiplexing gain M - 1.

U2 - 10.1109/ISIT.2015.7282462

DO - 10.1109/ISIT.2015.7282462

M3 - Conference contribution/Paper

T3 - Information Theory (ISIT), 2015 IEEE International Symposium on

SP - 286

EP - 290

BT - Information Theory (ISIT), 2015 IEEE International Symposium on

PB - IEEE

ER -