Gaussian secure source coding and Wyner's Common Information

@article{Satpathy2015GaussianSS,
  title={Gaussian secure source coding and Wyner's Common Information},
  author={Sanket Satpathy and P. Cuff},
  journal={2015 IEEE International Symposium on Information Theory (ISIT)},
  year={2015},
  pages={116-120}
}
  • Sanket Satpathy, P. Cuff
  • Published 2015
  • Computer Science, Mathematics
  • 2015 IEEE International Symposium on Information Theory (ISIT)
  • 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. 

    Figures and Topics from this paper.

    On Wyner's Common Information in the Gaussian Case.
    Distributed simulation of continuous random variables
    • 14
    • PDF
    Extracting Wyner's Common Information Using Polar Codes and Polar Lattices
    • Ling Liu, Jinwen Shi, Cong Ling
    • Mathematics
    • 2016
    Computing the Rate-Distortion Function of Gray-Wyner System
    Total correlation of Gaussian vector sources on the Gray-Wyner network
    • 10
    • Highly Influenced
    • PDF
    Synthesis of Gaussian trees with correlation sign ambiguity: An information theoretic approach
    • 5
    • PDF
    Relaxed Wyner’s Common Information
    • 4
    Gaussian Universal Features, Canonical Correlations, and Common Information
    • 5
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES
    A bit of secrecy for Gaussian source compression
    • 4
    • PDF
    Secure source coding with a public helper
    • 19
    • PDF
    Distributed Channel Synthesis
    • P. Cuff
    • Computer Science, Mathematics
    • 2013
    • 162
    • PDF
    A Framework for Partial Secrecy
    • P. Cuff
    • Computer Science, Mathematics
    • 2010
    • 39
    • PDF
    Rate-distortion theory for secrecy systems
    • 49
    • PDF
    Secrecy is cheap if the adversary must reconstruct
    • 20
    • PDF
    Optimal equivocation in secrecy systems a special case of distortion-based characterization
    • P. Cuff
    • Computer Science, Mathematics
    • 2013
    • 8
    • PDF
    Source-channel secrecy with causal disclosure
    • 7
    • PDF
    On secure source coding with side information at the encoder
    • 14
    • PDF