Perfectly Secure Encryption of Individual Sequences

In analogy to the well-known notion of finite-state compressibility of individual sequences, due to Lempel and Ziv, we define a similar notion of “finite-state encryptability” of an individual plain-text sequence, as the minimum asymptotic key rate that must be consumed by finite-state encrypters so as to guarantee perfect secrecy in a well-defined sense. Our main basic result is that the finite-state encryptability is equal to the finite-state compressibility for every individual sequence. This is in parallelism to Shannon's classical probabilistic counterpart result, asserting that the minimum required key rate is equal to the entropy rate of the source. However, the redundancy, defined as the gap between the upper bound (direct part) and the lower bound (converse part) in the encryption problem, turns out to decay at a different rate (in fact, much slower) than the analogous redundancy associated with the compression problem. We also extend our main theorem in several directions, allowing: 1) availability of side information (SI) at the encrypter/decrypter/eavesdropper, 2) lossy reconstruction at the decrypter, and 3) the combination of both lossy reconstruction and SI, in the spirit of the Wyner-Ziv problem.

[1]  Jacob Ziv Fixed-rate encoding of individual sequences with side information , 1984, IEEE Trans. Inf. Theory.

[2]  Gadiel Seroussi,et al.  On universal types , 2004, IEEE Transactions on Information Theory.

[3]  Jacob Ziv,et al.  Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.

[4]  Meir Feder,et al.  Communicating using feedback over a binary channel with arbitrary noise sequence , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[5]  J. Ziv Compression, tests for randomness and estimating the statistical model of an individual sequence , 1990 .

[6]  Neri Merhav,et al.  Efficient On-Line Schemes for Encoding Individual Sequences With Side Information at the Decoder , 2009, IEEE Transactions on Information Theory.

[7]  Neri Merhav Universal detection of messages via finite-state channels , 2000, IEEE Trans. Inf. Theory.

[8]  Meir Feder,et al.  Communication over Individual Channels -- a general framework , 2012, ArXiv.

[9]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[10]  David Haussler,et al.  Sequential Prediction of Individual Sequences Under General Loss Functions , 1998, IEEE Trans. Inf. Theory.

[11]  Neri Merhav,et al.  Universal schemes for sequential decision from individual data sequences , 1993, IEEE Trans. Inf. Theory.

[12]  Neri Merhav,et al.  On the Wyner-Ziv problem for individual sequences , 2006, IEEE Transactions on Information Theory.

[13]  Jacob Ziv,et al.  Distortion-rate theory for individual sequences , 1980, IEEE Trans. Inf. Theory.

[14]  Tsachy Weissman,et al.  Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence , 2001, IEEE Trans. Inf. Theory.

[15]  Meir Feder,et al.  Universal Communication—Part I: Modulo Additive Channels , 2013, IEEE Transactions on Information Theory.

[16]  Abraham Lempel,et al.  Cryptology in Transition , 1979, CSUR.

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

[18]  Hirosuke Yamamoto,et al.  Information theory in cryptology , 1991 .

[19]  Neri Merhav,et al.  Perfectly secure encryption of individual sequences , 2013, 2012 IEEE International Symposium on Information Theory Proceedings.

[20]  J. Muramatsu,et al.  Distortion-complexity and rate-distortion function , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[21]  Tsachy Weissman,et al.  On limited-delay lossy coding and filtering of individual sequences , 2002, IEEE Trans. Inf. Theory.

[22]  Neri Merhav,et al.  Optimal sequential probability assignment for individual sequences , 1994, IEEE Trans. Inf. Theory.

[23]  En-Hui Yang,et al.  Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm , 1996, IEEE Trans. Inf. Theory.

[24]  Martin E. Hellman,et al.  An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.

[25]  Neri Merhav,et al.  Twice-Universal Simulation of Markov Sources and Individual Sequences , 2010, IEEE Transactions on Information Theory.

[26]  Meir Feder,et al.  Universal Communication over Modulo-additive Channels with an Individual Noise Sequence , 2010, ArXiv.

[27]  Jacob Ziv,et al.  Coding theorems for individual sequences , 1978, IEEE Trans. Inf. Theory.

[28]  En-Hui Yang,et al.  Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity , 1996, IEEE Trans. Inf. Theory.

[29]  Neri Merhav,et al.  Universal prediction of individual sequences , 1992, IEEE Trans. Inf. Theory.

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

[31]  J. L. Massey,et al.  An introduction to contemporary cryptology , 1988, Proc. IEEE.

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

[33]  Neri Merhav,et al.  A measure of relative entropy between individual sequences with application to universal classification , 1993, IEEE Trans. Inf. Theory.

[34]  Neri Merhav,et al.  On Context - Tree Prediction of Individual Sequences , 2005, ITW.

[35]  Tsachy Weissman,et al.  Universal discrete denoising: known channel , 2003, IEEE Transactions on Information Theory.