On Compression of Data Encrypted With Block Ciphers

This paper investigates compression of data encrypted with block ciphers, such as the Advanced Encryption Standard. It is shown that such data can be feasibly compressed without knowledge of the secret key. Block ciphers operating in various chaining modes are considered and it is shown how compression can be achieved without compromising security of the encryption scheme. Further, it is shown that there exists a fundamental limitation to the practical compressibility of block ciphers when no chaining is used between blocks. Some performance results for practical code constructions used to compress binary sources are presented.

[1]  Ying Zhao,et al.  Compression of correlated binary sources using turbo codes , 2001, IEEE Communications Letters.

[2]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

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

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

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

[6]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[7]  Kannan Ramchandran,et al.  On Compressing Encrypted Data without the Encryption Key , 2004, TCC.

[8]  Craig Gentry,et al.  How to Compress Rabin Ciphertexts and Signatures (and More) , 2004, CRYPTO.

[9]  Yehuda Lindell,et al.  Introduction to Modern Cryptography , 2004 .

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

[11]  En-Hui Yang,et al.  A Lower Bound for Variable Rate Slepian-Wolf Coding , 2006, 2006 IEEE International Symposium on Information Theory.

[12]  Hugo Krawczyk,et al.  A Security Architecture for the Internet Protocol , 1999, IBM Syst. J..

[13]  Mihir Bellare,et al.  A concrete security treatment of symmet-ric encryption: Analysis of the DES modes of operation , 1997, FOCS 1997.

[14]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[15]  Bernd Girod,et al.  Compression with side information using turbo codes , 2002, Proceedings DCC 2002. Data Compression Conference.

[16]  Mihir Bellare,et al.  A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[17]  Christopher Allen,et al.  The TLS Protocol Version 1.0 , 1999, RFC.

[18]  Wenbo Mao,et al.  Modern Cryptography: Theory and Practice , 2003 .

[19]  En-hui Yang,et al.  On the Relationship between Redundancy and Decoding Error in Slepian-Wolf Coding , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[20]  Randall J. Atkinson,et al.  Security Architecture for the Internet Protocol , 1995, RFC.

[21]  Ian F. Blake,et al.  Elliptic Curves in Cryptography: Preface , 1999 .

[22]  Dirk Fox,et al.  Advanced Encryption Standard (AES) , 1999, Datenschutz und Datensicherheit.

[23]  G. S. Vernam,et al.  Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.

[24]  F. Kanaya,et al.  Coding Theorems on Correlated General Sources , 1995 .

[25]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[26]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.