Date Added: Mar 2011
The authors study the problem of generating a shared secret key between two terminals in a joint source-channel setup - the terminals communicate over a discrete memoryless wiretap channel and additionally the terminals have access to correlated discrete memoryless source sequences. They establish lower and upper bounds on the secret-key capacity. These bounds coincide, thus establishing the capacity, when the underlying channel consists of a set of independent, parallel and reversely degraded wiretap channels. In the lower bound expression, the equivocation terms of the source and channel components are functionally additive.