In coding schemes for the wire-tap channel or the broadcast channels with
confidential messages, it is well known that the sender needs to use a
stochastic encoding to avoid the information about the transmitted confidential
message to be leaked to an eavesdropper. In this paper, it is investigated that
the trade-off between the rate of the random number to realize the stochastic
encoding and the rates of the common, private, and confidential messages.
We investigate the secret key agreement from correlated vector Gaussian
sources in which the legitimate parties can use the public communication with
limited rate. For the class of protocols with the one-way public communication,
we show that the optimal trade-off between the rate of key generation and the
rate of the public communication is characterized as an optimization problem of
a Gaussian random variable. The characterization is derived by using the
enhancement technique introduced by Weingarten et.al. for MIMO Gaussian
broadcast channel.
In 1973, Arimoto proved the strong converse theorem for the discrete
memoryless channels stating that when transmission rate $R$ is above channel
capacity $C$, the error probability of decoding goes to one as the block length
$n$ of code word tends to infinity. He proved the theorem by deriving the
exponent function of error probability of correct decoding that is positive if
and only if $R>C$. Subsequently, in 1979, Dueck and K\"orner determined the
optimal exponent of correct decoding. Arimoto's bound has been said to be equal
to the bound of Dueck and K\"orner.
We consider the distributed source coding system of $L$ correlated Gaussian
sources $Y_i,i=1,2,\cdots,L$ which are noisy observations of correlated
Gaussian remote sources $X_k, k=1,2,\cdots,K$. We assume that $Y^{L}={}^{\rm
t}(Y_1,Y_2,$ $\cdots, Y_L)$ is an observation of the source vector $X^K={}^{\rm
t}(X_1,X_2,\cdots, X_K)$, having the form $Y^L=AX^K+N^L$, where $A$ is a
$L\times K$ matrix and $N^L={}^{\rm t}(N_1,N_2,\cdots,N_L)$ is a vector of $L$
independent Gaussian random variables also independent of $X^K$.
We investigate the secret key agreement from correlated Gaussian sources in
which the legitimate parties can use the public communication with limited
rate. For the class of protocols with the one-way public communication, we show
a closed form expression of the optimal trade-off between the rate of key
generation and the rate of the public communication. Our results clarify an
essential difference between the key agreement from discrete sources and that
from continuous sources.
We consider a distributed source coding problem of $L$ correlated Gaussian
observations $Y_i, i=1,2,...,L$.