Home > Research > Publications & Outputs > Simultaneously generating secret and private ke...

Electronic data

  • SK_PK2

    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.64 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

Simultaneously generating secret and private keys in a cooperative pairwise-independent network

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Simultaneously generating secret and private keys in a cooperative pairwise-independent network. / Xu, Peng; Ding, Zhiguo; Dai, Xuchu et al.
In: IEEE Transactions on Information Forensics and Security, Vol. 11, No. 6, 06.2016, p. 1139-1150.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Xu, P, Ding, Z, Dai, X & Karagiannidis, GK 2016, 'Simultaneously generating secret and private keys in a cooperative pairwise-independent network', IEEE Transactions on Information Forensics and Security, vol. 11, no. 6, pp. 1139-1150. https://doi.org/10.1109/TIFS.2016.2516970

APA

Xu, P., Ding, Z., Dai, X., & Karagiannidis, G. K. (2016). Simultaneously generating secret and private keys in a cooperative pairwise-independent network. IEEE Transactions on Information Forensics and Security, 11(6), 1139-1150. https://doi.org/10.1109/TIFS.2016.2516970

Vancouver

Xu P, Ding Z, Dai X, Karagiannidis GK. Simultaneously generating secret and private keys in a cooperative pairwise-independent network. IEEE Transactions on Information Forensics and Security. 2016 Jun;11(6):1139-1150. Epub 2016 Jan 12. doi: 10.1109/TIFS.2016.2516970

Author

Xu, Peng ; Ding, Zhiguo ; Dai, Xuchu et al. / Simultaneously generating secret and private keys in a cooperative pairwise-independent network. In: IEEE Transactions on Information Forensics and Security. 2016 ; Vol. 11, No. 6. pp. 1139-1150.

Bibtex

@article{67a4fe0c9fe1490e9eb496e1b8338f25,
title = "Simultaneously generating secret and private keys in a cooperative pairwise-independent network",
abstract = "This paper studies the problem of simultaneously generating a secret key (SK) and a private key (PK) between Alice and Bob, in a cooperative pairwise-independent network (PIN) with two relays. In the PIN, the pairwise source observed by every pair of terminals is independent of those sources observed by any other pairs. The SK needs to be protected from Eve, while the PK needs to be protected not only from Eve but also from the two relays. Two cooperative SK-PK generation algorithms are proposed: both of them first generate common randomness, based on the well-established pairwise key generation technique and the application of the one-time pad; but then, the two algorithms utilize the XOR operation and a specific random-binning-based SK-PK codebook to generate the expected keys, respectively. The achievable SK-PK rate regions of both the two proposed algorithms are analyzed. Of particular interest is the second algorithm with random-bing based codebook, whose achievable key rate region is demonstrated to be exactly the same as the derived outer bound, a crucial step for establishing the key capacity of this PIN model. Finally, the two proposed SK-PK generation algorithms are extended to a cooperative wireless network, where the correlated source observations are obtained from estimating wireless channels during a training phase.",
keywords = "Cooperative PIN model, Information-theoretic security, key capacity region, private key, secret key",
author = "Peng Xu and Zhiguo Ding and Xuchu Dai and Karagiannidis, {George K.}",
note = "{\textcopyright}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.",
year = "2016",
month = jun,
doi = "10.1109/TIFS.2016.2516970",
language = "English",
volume = "11",
pages = "1139--1150",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - Simultaneously generating secret and private keys in a cooperative pairwise-independent network

AU - Xu, Peng

AU - Ding, Zhiguo

AU - Dai, Xuchu

AU - Karagiannidis, George K.

N1 - ©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.

PY - 2016/6

Y1 - 2016/6

N2 - This paper studies the problem of simultaneously generating a secret key (SK) and a private key (PK) between Alice and Bob, in a cooperative pairwise-independent network (PIN) with two relays. In the PIN, the pairwise source observed by every pair of terminals is independent of those sources observed by any other pairs. The SK needs to be protected from Eve, while the PK needs to be protected not only from Eve but also from the two relays. Two cooperative SK-PK generation algorithms are proposed: both of them first generate common randomness, based on the well-established pairwise key generation technique and the application of the one-time pad; but then, the two algorithms utilize the XOR operation and a specific random-binning-based SK-PK codebook to generate the expected keys, respectively. The achievable SK-PK rate regions of both the two proposed algorithms are analyzed. Of particular interest is the second algorithm with random-bing based codebook, whose achievable key rate region is demonstrated to be exactly the same as the derived outer bound, a crucial step for establishing the key capacity of this PIN model. Finally, the two proposed SK-PK generation algorithms are extended to a cooperative wireless network, where the correlated source observations are obtained from estimating wireless channels during a training phase.

AB - This paper studies the problem of simultaneously generating a secret key (SK) and a private key (PK) between Alice and Bob, in a cooperative pairwise-independent network (PIN) with two relays. In the PIN, the pairwise source observed by every pair of terminals is independent of those sources observed by any other pairs. The SK needs to be protected from Eve, while the PK needs to be protected not only from Eve but also from the two relays. Two cooperative SK-PK generation algorithms are proposed: both of them first generate common randomness, based on the well-established pairwise key generation technique and the application of the one-time pad; but then, the two algorithms utilize the XOR operation and a specific random-binning-based SK-PK codebook to generate the expected keys, respectively. The achievable SK-PK rate regions of both the two proposed algorithms are analyzed. Of particular interest is the second algorithm with random-bing based codebook, whose achievable key rate region is demonstrated to be exactly the same as the derived outer bound, a crucial step for establishing the key capacity of this PIN model. Finally, the two proposed SK-PK generation algorithms are extended to a cooperative wireless network, where the correlated source observations are obtained from estimating wireless channels during a training phase.

KW - Cooperative PIN model

KW - Information-theoretic security

KW - key capacity region

KW - private key

KW - secret key

U2 - 10.1109/TIFS.2016.2516970

DO - 10.1109/TIFS.2016.2516970

M3 - Journal article

VL - 11

SP - 1139

EP - 1150

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 6

ER -