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 - Funding Information:
The work of P. Xu and X. Dai was supported in part by the National Natural Science Foundation of China under Grant 61471334, in part by the National Basic Research Program of China (973 Program) under Grant 2013CB329004, and in part by the China Post-Doctoral Science Foundation under Project 2015M570544. The work of Z. Ding was supported in part by the Royal Society under Grant IE140855 and in part by the U.K. Engineering and Physical Sciences Research Council under Grant EP/L025272/1.
Publisher Copyright:
© 2015 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
UR - http://www.scopus.com/inward/record.url?scp=84963945180&partnerID=8YFLogxK
U2 - 10.1109/TIFS.2016.2516970
DO - 10.1109/TIFS.2016.2516970
M3 - Article
AN - SCOPUS:84963945180
SN - 1556-6013
VL - 11
SP - 1139
EP - 1150
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
IS - 6
M1 - 7378467
ER -