Secret-Key Generation Using Correlated Sources and Channels. Khisti, A, Diggavi, S., & Wornell, G. W. Information Theory, IEEE Transactions on, 58(2):652-670, Feb, 2012.
doi  abstract   bibtex   
We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.
@article{kdw_j11,
 abstract = {We study the secret-key capacity in a joint source-channel coding setup-the terminals are connected over a discrete memoryless channel and have access to side information, modelled as a pair of discrete memoryless source sequences. As our main result, we establish the upper and lower bounds on the secret-key capacity. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive even though the coding scheme generates a single secret-key by jointly taking into account the source and channel equivocations. Our bounds coincide, thus establishing the capacity, when the underlying wiretap channel can be decomposed into a set of independent, parallel, and reversely degraded channels. For the case of parallel Gaussian channels and jointly Gaussian sources we show that Gaussian codebooks achieve the secret-key capacity. In addition, when the eavesdropper also observes a correlated side information sequence, we establish the secret-key capacity when both the source and channel of the eavesdropper are a degraded version of the legitimate receiver. We finally also treat the case when a public discussion channel is available, propose a separation based coding scheme, and establish its optimality when the channel output symbols of the legitimate receiver and eavesdropper are conditionally independent given the input.},
 author = {Khisti, A and Diggavi, S.N. and Wornell, Gregory W.},
 doi = {10.1109/TIT.2011.2173629},
 file = {:papers:secret_keygen.pdf},
 issn = {0018-9448},
 journal = {Information Theory, IEEE Transactions on},
 label = {kdw_j11},
 month = {Feb},
 number = {2},
 pages = {652-670},
 tags = {journal,ITsecrecy,KeyGen,IT,WiNetSec,SrcChanSec},
 title = {Secret-Key Generation Using Correlated Sources and Channels},
 type = {2},
 volume = {58},
 year = {2012}
}

Downloads: 0