Email this article 
Open Access
Subscription or Fee Access
A Lossless Approach for Data Hiding using LZW Codes
Abstract
Hiding a message in compression codes can reduce transmission costs and simultaneously make the transmission more secure. In high-performance, data-hiding Lempel–Ziv–Welch (HPDH-LZW) scheme, which reversibly embeds data in LZW compression codes by modifying the value of the compression codes, where the value of the LZW code either remains unchanged or is changed to the original value of the LZW code plus the LZW dictionary size according to the data to be embedded. According to the embedding bits, the original value of LZW code is modified. Reversible data hiding scheme is used in compression domain where compression code is altered to hide the data. Compared to other information-hiding schemes based on LZW compression codes, the proposed scheme achieves better hiding capacity by increasing the number of symbols available to hide secrets and also achieves faster hiding and extracting speeds due to the lower computation requirements.
Keywords
References
Chang C.C, Lee C.F, Chuang L.Y, (2009), ‘Embedding secret binary message using locally adaptive data compression coding’, International Journal of Computer Sciences and Engineering Systems, Vol.3, No.1, pp 55-61.
Chang C.C, Lin C.Y, (2007), ‘Reversible Steganographic method using SMVQ Approach based on declustering’, Information Sciences, Vol.177, No.8, pp 1796-1805.
Chang C.C, Lu T.C, (2006), ‘Reversible index domain information hiding scheme based on side-match vector quantization’, Journal of Systems and Software, Vol.79, No.8, pp.1120-1129.
Chang C.C, Wu W.C, (2006), ‘A Steganographic method for hiding secret data using side match vector quantization’, IEICE Transactions on Information and Systems, Vol.8, No.9, pp.2159-2167.
Chen C.C, Chang C.C, (2010), ‘High Capacity reversible data hiding for LZW codes’, In proceedings of the second International conference on Computer Modeling and Simulation, No.1, pp.3-8.
Chen W.J, Huang W.T, (2009), ‘VQ indexes compression and information hiding using hybrid lossless index coding’, Digital Signal Processing, Vol.19, No.3, pp.433-443.
Jo M, Kim H.D, (2002), ‘A Digital image watermarking scheme based on vector quantization’, IEICE Transactions on Information and Systems, Vol.85, No.6, pp.1054-1056.
Lu Z.M, Wang J.X, Liu B.B, (2011), ‘An improved lossless data hiding scheme based on image VQ index residual coding’, Journal of Systems and Software, Vol.82, No.6, pp.1016-1024.
Ma K, Zhang X, Yu N, Li F, (2013), ‘Reversible data hiding in encrypted images by reserving room before Encryption’, IEEE Transactions on Information Forensics and Security, Vol.8, No.3, pp.553-562.
Nandi U, Mandal J.K,(2012), ‘A compression technique based on optimality of LZW code (OLZW)’, Third International Conference on Computer and Communication Technology(ICCCT), Vol.1, pp.166-170.
Shim H.J, Ahn J, Jeon B, (2004), ‘DH-LZW Data hiding in the Compression codes’, In Proceedings of the International conference on image processing, Vol.2, No.4, pp.2195–2198.
Tai W.L, Yeh C.M, Chang C.C, (2009), ‘Reversible Data Hiding based on Histogram modification of pixel differences’, IEEE Transactions on Circuits and Systems for Video technology, Vol.19, No.6, pp.906-910.
Tseng H.W, Chang C.C, (2008), ‘An Extended Difference expansion algorithm foe reversible watermarking’, Image and Vision Computing, Vol.26, No.8, pp.1148-1153.
Wang Z.H, Yang H.R, Cheng T.F, (2013), ‘High Performance reversible data hiding scheme for LZW codes’, Journal of Systems and Software, Vol.86, No.3, pp 2771-2778.
Zhang, X.P, (2013), ‘Reversible data hiding with optimal value transfer’, IEEE Transactions on Multimedia, Vol.15, No.2, pp 316–325.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.