Skip to main content

A Bit of Secrecy for Gaussian Source Compression

Author(s): Song, Eva C; Cuff, Paul; Poor, H Vincent

To refer to this page use:
Abstract: In this paper, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice, legitimate receiver Bob, and eavesdropper Eve), the problem of how to efficiently compress a Gaussian source with limited secret key in order to guarantee that Bob can reconstruct with high fidelity while preventing Eve from estimating an accurate reconstruction is investigated. It is assumed that Alice and Bob share a secret key with limited rate. Three scenarios are studied, in which the eavesdropper ranges from weak to strong in terms of the causal side information she has. It is shown that one bit of secret key per source symbol is enough to achieve perfect secrecy performance in the Gaussian squared error setting, and the information theoretic region is not optimized by joint Gaussian random variables.
Publication Date: 2013
Citation: Song, E. C., Cuff, P., & Poor, H. V. (2013). A bit of secrecy for gaussian source compression. 2013 IEEE International Symposium on Information Theory, 2567-2571.doi:10.1109/ISIT.2013.6620690
DOI: 10.1109/ISIT.2013.6620690
ISSN: 2157-8095
EISSN: 2157-8117
Pages: 2567-2571
Type of Material: Conference Article
Journal/Proceeding Title: 2013 IEEE International Symposium on Information Theory
Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.