Zero-Delay and Causal Secure Source Coding

We investigate the combination between causal/zero-delay source coding and information-theoretic secrecy. Two source coding models with secrecy constraints are considered. We start by considering zero-delay perfectly secret lossless transmission of a memoryless source. We derive bounds on the key rate and coding rate needed for perfect zero-delay secrecy. In this setting, we consider two models that differ by the ability of the eavesdropper to parse the bit-stream passing from the encoder to the legitimate decoder into separate messages. We also consider causal source coding with a fidelity criterion and side information at the decoder and the eavesdropper. Unlike the zero-delay setting where variable-length coding is traditionally used but might leak information on the source through the length of the codewords, in this setting, since delay is allowed, block coding is possible. We show that in this setting, a separation of encryption and causal source coding is optimal.

[1]  Vinod M. Prabhakaran,et al.  On compressing encrypted data , 2004, IEEE Transactions on Signal Processing.

[2]  Neri Merhav,et al.  Zero-Delay and Causal Single-User and Multi-User Lossy Source Coding with Decoder Side Information , 2014, IEEE Transactions on Information Theory.

[3]  Neri Merhav,et al.  On real-time and causal secure source coding , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[5]  Tsachy Weissman,et al.  On causal source codes with side information , 2005, IEEE Transactions on Information Theory.

[6]  Noga Alon,et al.  A lower bound on the expected length of one-to-one codes , 1994, IEEE Trans. Inf. Theory.

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

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

[9]  Terence Chan,et al.  Design of error-free perfect secrecy system by prefix codes and partition codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[10]  Paul W. Cuff,et al.  Rate-distortion theory for secrecy systems , 2013, 2013 IEEE International Symposium on Information Theory.

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

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

[13]  R. Durrett Probability: Theory and Examples , 1993 .

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

[15]  Pablo Piantanida,et al.  Secure Multiterminal Source Coding With Side Information at the Eavesdropper , 2011, IEEE Transactions on Information Theory.

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

[17]  Noga Alon,et al.  Source coding and graph entropies , 1996, IEEE Trans. Inf. Theory.

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

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

[20]  A. J. Viterbi,et al.  A Lower Bound on the Expected Length of One-to-one Codes , 1994 .

[21]  David L. Neuhoff,et al.  Causal source codes , 1982, IEEE Trans. Inf. Theory.