On the Shannon cipher system with a wiretapper guessing subject to distortion and reliability requirements

We modify the problem studied by Merhav and Arikan (see IEEE Trans. Inform. Theory, vol.45, no.6, p.1860-6, 1999) of discrete memoryless source encrypted messages guessing by wiretapper within given distortion level /spl Delta/ in the case of Shannon cipher system. The security of the system is measured by the expected number of guesses of a wiretapper needed for the reconstruction of the source messages on the base of cryptograms. The main modification is consideration of the distortion and reliability criteria and of possibility to limit the number of guesses.

[1]  O. F. Cook.  The Method of Types , 1898 .

[2]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[3]  Neri Merhav,et al.  Joint Source-Channel Coding and Guessing with Application to Sequential Decoding , 1998, IEEE Trans. Inf. Theory.

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

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

[6]  Katalin Marton,et al.  Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.

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

[8]  J. Massey.  Guessing and entropy , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[9]  Ashot N. Harutyunyan,et al.  On properties of rate-reliability-distortion functions , 2004, IEEE Transactions on Information Theory.

[10]  David Malone,et al.  Guesswork and entropy , 2004, IEEE Transactions on Information Theory.

[11]  Neri Merhav,et al.  Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.

[12]  Andrea Sgarro.  Error probabilities for simple substitution ciphers , 1983, IEEE Trans. Inf. Theory.

[13]  E. Haroutunian,et al.  On the rates-reliability-distortions and partial secrecy region of a one-stage branching communication system , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[14]  Prakash Narayan,et al.  Error exponents for successive refinement by partitioning , 1996, IEEE Trans. Inf. Theory.

[15]  Rudolf Ahlswede,et al.  Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .

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

[17]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[18]  Kenneth Rose,et al.  Error exponents in scalable source coding , 2003, IEEE Trans. Inf. Theory.

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

[20]  Erdal Arikan.  An inequality on guessing and its application to sequential decoding , 1996, IEEE Trans. Inf. Theory.

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

[22]  Ashot N. Harutyunyan,et al.  On rate-reliability-distortion function for a robust descriptions system , 2000, IEEE Trans. Inf. Theory.