Encrypting Huffman-Encoded Data by Substituting Pairs of Code Words without Changing the Bit Count of a Pair

This paper presents a method for combining the Huffman coding with encryption. The encryption is based on replacing Huffman code words, or symbols, pair-by-pair, in such a way that the sums of the code word lengths of an original pair and its substitute are equal. Thus our method preserves structures and lengths of bit streams that result from the Huffman encoding. This is advantageous if such a bit stream is embedded in a higher-level data container, like a multimedia file. The algorithm has been evaluated using text data and static Huffman dictionaries.

[1]  Chih-Cheng Chen,et al.  Enhanced Huffman Coding with Encryption for Wireless Data Broadcasting System , 2012, 2012 International Symposium on Computer, Consumer and Control.

[2]  C.-C. Jay Kuo,et al.  Fast encryption methods for audiovisual data confidentiality , 2001, SPIE Optics East.

[3]  Kwok-Wo Wong,et al.  On the security of multiple Huffman table based encryption , 2011, J. Vis. Commun. Image Represent..

[4]  Andreas Uhl,et al.  Bitstream-Based JPEG Encryption in Real-time , 2013, Int. J. Digit. Crime Forensics.

[5]  C.-C. Jay Kuo,et al.  Design of integrated multimedia compression and encryption systems , 2005, IEEE Transactions on Multimedia.

[6]  Philip Ogunbona,et al.  Secure compression using adaptive Huffman coding , 2000 .

[7]  Christophe De Vleeschouwer,et al.  Overview on Selective Encryption of Image and Video: Challenges and Perspectives , 2008, EURASIP J. Inf. Secur..

[8]  Oscar C. Au,et al.  Adaptive Chosen-Ciphertext Attack on Secure Arithmetic Coding , 2009, IEEE Transactions on Signal Processing.

[9]  K. P. Subbalakshmi,et al.  Cryptanalysis of Some Multimedia Encryption Schemes , 2008, IEEE Transactions on Multimedia.

[10]  M. Oguzhan Kulekci.  A Method to Ensure the Confidentiality of the Compressed Data , 2011, CCP 2011.

[11]  Janusz Kacprzyk,et al.  Autonomous Systems: Developments and Trends , 2012, Studies in Computational Intelligence.

[12]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[13]  Safya Belghith,et al.  Joint compression and encryption using chaotically mutated Huffman trees , 2010 .

[14]  Shujun Li.  On the Performance of Secret Entropy Coding: A Perspective Beyond Security , 2012, Autonomous Systems: Developments and Trends.

[15]  Oscar C. Au,et al.  Security Analysis of Multimedia Encryption Schemes Based on Multiple Huffman Table , 2007, IEEE Signal Processing Letters.