Secure Multiterminal Source Coding With Side Information at the Eavesdropper

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously satisfying the desired requirements on the distortion level at a legitimate receiver (referred to as Bob) and the equivocation rate-average uncertainty-at an eavesdropper (referred to as Eve). It is further assumed the presence of a (public) rate-limited link between Alice and Bob. In this setting, Eve perfectly observes the information bits sent by Alice to Bob and has also access to a correlated source which can be used as side information. A second encoder (referred to as Charlie) helps Bob in estimating Alice's source by sending a compressed version of its own correlated observation via a (private) rate-limited link, which is only observed by Bob. For instance, the problem at hands can be seen as the unification between the Berger-Tung and the secure source coding setups. Inner and outer bounds on the so-called rate-distortion-equivocation region are derived. The inner region turns to be tight for two cases: 1) uncoded side information at Bob and 2) lossless reconstruction of both sources at Bob-secure distributed lossless compression. Application examples to secure lossy source coding of Gaussian and binary sources in the presence of Gaussian and binary/ternary (respectively) side informations are also considered. Optimal coding schemes are characterized for some cases of interest where the statistical differences between the side information at the decoders and the presence of a nonzero distortion at Bob can be fully exploited to guarantee secrecy.

[1]  Carles Padró,et al.  Information Theoretic Security , 2013, Lecture Notes in Computer Science.

[2]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[3]  Te Sun Han,et al.  A unified achievable rate region for a general class of multiterminal source coding systems , 1980, IEEE Trans. Inf. Theory.

[4]  Sergio D. Servetto,et al.  Lattice Quantization With Side Information: Codes, Asymptotics, and Applications in Sensor Networks , 2006, IEEE Transactions on Information Theory.

[5]  Richard E. Blahut,et al.  Partial side information problem: Equivalence of two inner bounds , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[6]  H. Vincent Poor,et al.  Lossless compression with security constraints , 2008, 2008 IEEE International Symposium on Information Theory.

[7]  Amiram H. Kaspi,et al.  Rate-distortion function when side-information may be present at the decoder , 1994, IEEE Trans. Inf. Theory.

[8]  Tie Liu,et al.  An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems , 2006, IEEE Transactions on Information Theory.

[9]  Shlomo Shamai,et al.  Secure Communication Over Fading Channels , 2007, IEEE Transactions on Information Theory.

[10]  Toby Berger,et al.  The CEO problem [multiterminal source coding] , 1996, IEEE Trans. Inf. Theory.

[11]  Pramod Viswanath,et al.  Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem , 2005, IEEE Transactions on Information Theory.

[12]  Byung-Jae Kwak,et al.  LDPC Codes for the Gaussian Wiretap Channel , 2009, IEEE Transactions on Information Forensics and Security.

[13]  A. Robert Calderbank,et al.  Applications of LDPC Codes to the Wiretap Channel , 2004, IEEE Transactions on Information Theory.

[14]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[15]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[16]  Sennur Ulukus,et al.  Secrecy in Cooperative Relay Broadcast Channels , 2008, IEEE Transactions on Information Theory.

[17]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[18]  Suhas N. Diggavi,et al.  Side-Information Scalable Source Coding , 2007, IEEE Transactions on Information Theory.

[19]  Robert M. Gray,et al.  Encoding of correlated observations , 1987, IEEE Trans. Inf. Theory.

[20]  Neri Merhav On the shannon cipher system with a capacity-limited key-distribution channel , 2006, IEEE Transactions on Information Theory.

[21]  Gerhard Kramer Capacity results for the discrete memoryless network , 2003, IEEE Trans. Inf. Theory.

[22]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[23]  Suhas N. Diggavi,et al.  On Multistage Successive Refinement for Wyner–Ziv Source Coding With Degraded Side Informations , 2007, IEEE Transactions on Information Theory.

[24]  Haim H. Permuter,et al.  Two-Way Source Coding With a Helper , 2008, IEEE Transactions on Information Theory.

[25]  Ruoheng Liu,et al.  Securing Wireless Communications at the Physical Layer , 2014 .

[26]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

[27]  Zhen Zhang,et al.  On the CEO problem , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[28]  H. Vincent Poor,et al.  Secure Nested Codes for Type II Wiretap Channels , 2007, 2007 IEEE Information Theory Workshop.

[29]  Yasutada Oohama,et al.  The Rate-Distortion Function for the Quadratic Gaussian CEO Problem , 1998, IEEE Trans. Inf. Theory.

[30]  Shigeki Miyake,et al.  Construction of wiretap channel codes by using sparse matrices , 2009, 2009 IEEE Information Theory Workshop.

[31]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[32]  Pablo Piantanida,et al.  Secure lossy source coding with side information at the decoders , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[33]  A. Wagner,et al.  The lossy one-helper conjecture is false , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[34]  Alexander Vardy,et al.  Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes , 2010, IEEE Transactions on Information Theory.

[35]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[36]  Hirosuke Yamamoto,et al.  A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers , 1983, IEEE Trans. Inf. Theory.

[37]  Hirosuke Yamamoto Rate-distortion theory for the Shannon cipher system , 1997, IEEE Trans. Inf. Theory.

[38]  Bin Dai,et al.  Wiretap Channel With Side Information , 2006, ArXiv.

[39]  Kannan Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 2003, IEEE Trans. Inf. Theory.

[40]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[41]  H. Vincent Poor,et al.  Secure lossless compression with side information , 2008, 2008 IEEE Information Theory Workshop.

[42]  Hirosuke Yamamoto Coding theorems for Shannon's cipher system with correlated source outputs, and common information , 1994, IEEE Trans. Inf. Theory.

[43]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[44]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[45]  Aaron D. Wyner,et al.  On source coding with side information at the decoder , 1975, IEEE Trans. Inf. Theory.

[46]  Kannan Ramchandran,et al.  Secure Source Coding With a Helper , 2009, IEEE Transactions on Information Theory.

[47]  Alex J. Grant,et al.  Rate Distortion With Side-Information at Many Decoders , 2009, IEEE Transactions on Information Theory.

[48]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[49]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[50]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[51]  J. Wolfowitz The rate distortion function for source coding with side information at the decoder , 1979 .

[52]  Yasutada Oohama,et al.  Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder , 2005, IEEE Transactions on Information Theory.

[53]  Suhas N. Diggavi,et al.  Multistage successive refinement for Wyner-Ziv source coding with degraded side informations , 2006, 2006 IEEE International Symposium on Information Theory.

[54]  Masahito Hayashi,et al.  Construction of wiretap codes from ordinary channel codes , 2010, 2010 IEEE International Symposium on Information Theory.

[55]  J. Barros,et al.  LDPC codes for the Gaussian wiretap channel , 2009 .

[56]  Chandra Nair,et al.  Capacity regions of two new classes of 2-receiver broadcast channels , 2009, 2009 IEEE International Symposium on Information Theory.

[57]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.

[58]  Olivier Rioul,et al.  Information Theoretic Proofs of Entropy Power Inequalities , 2007, IEEE Transactions on Information Theory.

[59]  Toby Berger,et al.  Successive Wyner–Ziv Coding Scheme and Its Application to the Quadratic Gaussian CEO Problem , 2006, IEEE Transactions on Information Theory.

[60]  V. Prabhakaran,et al.  On Secure Distributed Source Coding , 2007, 2007 IEEE Information Theory Workshop.

[61]  Neri Merhav Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels , 2008, IEEE Transactions on Information Theory.

[62]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[63]  Toby Berger,et al.  Multiterminal source encoding with one distortion criterion , 1989, IEEE Trans. Inf. Theory.

[64]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

[65]  Toby Berger,et al.  Rate-distortion for correlated sources with partially separated encoders , 1982, IEEE Trans. Inf. Theory.

[66]  Pablo Piantanida,et al.  Secure distributed lossless compression with side information at the eavesdropper , 2011, VALUETOOLS.

[67]  Toby Berger,et al.  An upper bound on the rate distortion function for source coding with partial side information at the decoder , 1979, IEEE Trans. Inf. Theory.

[68]  Aaron B. Wagner,et al.  Rate Region of the Gaussian Scalar-Help-Vector Source-Coding Problem , 2012, IEEE Transactions on Information Theory.

[69]  Yasutada Oohama Gaussian multiterminal source coding , 1997, IEEE Trans. Inf. Theory.

[70]  J. N. Laneman,et al.  On the secrecy capacity of arbitrary wiretap channels , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[71]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[72]  Hirosuke Yamamoto A rate-distortion problem for a communication system with a secondary decoder to be hindered , 1988, IEEE Trans. Inf. Theory.

[73]  Ueli Maurer,et al.  Secret key agreement by public discussion , 1993 .

[74]  Ueli Maurer,et al.  Introduction to the Special Issue on Information Theoretic Security , 2008, IEEE Trans. Inf. Theory.

[75]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.