DocumentCode :
586702
Title :
An implementation of steganography using construction of Huffman tree
Author :
Hiroshi, Y. ; Hayato, F.
Author_Institution :
Sch. of Inf. & Telecommun. Eng., Tokai Univ., Tokai, Japan
fYear :
2012
fDate :
28-31 Oct. 2012
Firstpage :
634
Lastpage :
637
Abstract :
We propose an implementation of steganography embedding secret information without degradation of the data quality or increase of data size using Huffman coding. When general digital data are compressed using Huffman coding, the alphabet and the symbol frequency of the source depend on the data. In many cases, the statistics of the data are investigated and code table optimized for the data is constructed and then, encoding is applied with the code table and encoded data are stored together with the coding table. In this paper, we propose an implementation of embedding data using degrees of freedom in Huffman coding. Any digital data can be used as cover data and the quality of data is completely preserved because the compression is lossless. The proposed method contributes to the expansion of the application of steganography and to the improvement of security of digital data.
Keywords :
Huffman codes; encoding; security of data; steganography; Huffman coding; Huffman tree; code table; data quality; data security; embedding data; embedding secret information; encoding; steganography; symbol frequency; Data mining; Decoding; Educational institutions; Huffman coding; Receivers; Silicon;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and its Applications (ISITA), 2012 International Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
978-1-4673-2521-9
Type :
conf
Filename :
6401016
Link To Document :
بازگشت