Variable-length compression and secrecy by design

The framework of secrecy by design is introduced and the fundamental limits of lossless data compression are characterized for this setting. The main idea behind secrecy by design is to begin with an operational secrecy constraint, which is modeled by a secrecy function fs, and then to derive fundamental limits for the performance of the resulting secrecy system. In the setting of lossless compression, it is shown that strong information-theoretic secrecy guarantees can be achieved using a reduced secret key size and a modular two-part coding strategy. Focusing on the non-asymptotic fundamental limits of lossless compression, variable-length lossless compression is studied. It is noted that completely lossless compression is not possible when perfect secrecy is required; however, it becomes meaningful under partial secrecy constraints. Moreover, although it is well known that the traditional fundamental limits of variable-length and almost lossless fixed-length compression are intimately related, this relationship collapses once the secrecy constraint is incorporated.

[1]  Sudeep Kamath,et al.  An Operational Approach to Information Leakage , 2018, IEEE Transactions on Information Theory.

[2]  Hirosuke Yamamoto,et al.  Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs , 2006, IEEE Transactions on Information Theory.

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

[4]  Bruce E. Hajek,et al.  Evaluation of an achievable rate region for the broadcast channel , 1979, IEEE Trans. Inf. Theory.

[5]  H. Vincent Poor,et al.  Secure lossless compression , 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

[6]  Neri Merhav Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels , 2007, ISIT.

[7]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[8]  Paul W. Cuff,et al.  The Henchman problem: Measuring secrecy by the minimum distortion in a list , 2014, ISIT.

[9]  Neri Merhav A large-deviations notion of perfect secrecy , 2003, IEEE Trans. Inf. Theory.

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

[12]  Neri Merhav,et al.  The Shannon cipher system with a guessing wiretapper , 1999, IEEE Trans. Inf. Theory.

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

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

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

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

[17]  Elza Erkip,et al.  Source Coding under Secrecy Constraints , 2009 .

[18]  Aaron B. Wagner,et al.  Measuring secrecy by the probability of a successful guess , 2015, Allerton.

[19]  Sergio Verdú,et al.  Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.