2000 character limit reached
Gaussian Secure Source Coding and Wyner's Common Information (1506.00193v2)
Published 31 May 2015 in cs.IT and math.IT
Abstract: We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We explicitly characterize the tradeoff between the rates of communication and secret key. This tradeoff is the result of a mutual information optimization under Markov constraints. As a corollary, we deduce a general formula for Wyner's Common Information in the Gaussian setting.