Dictionary module and UDC: Two new approaches to enhance embedding capacity of a steganographic channel
MetadataShow full item record
Copyright 2005 IEEE. Reprinted from: 2005 3rd IEEE International Conference on Industrial Informatics (INDIN) Perth, Australia 10-12 August 2005. IEEE Catalog Number 05EX1057
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Curtin University of Technology's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
In this paper we present a new technique to enhance embedding capacity of a steganographic channel by preprocessing the secret data. Here we limit ourselves to textual data only. By preprocessing we don't mean compression; secret data can be compressed after it has been preprocessed by our technique. We introduce the concept of Scrambled Letters, User Defined Codes and the Dictionary Module to explain our technique. All these concepts when applied together give a phenomenal embedding capacity. Theoretical results show that we can achieve at least 25-30% increase in embedding capacity. We introduce two techniques, one in which we only apply the dictionary concept while the other in which we use the user defined codes along with the dictionary approach. The former technique is generic and can be applied to any form of textual data, whereas the latter can only be applied to pure text, i.e. without any form of graphics like images or graphs. Once the data is preprocessed by using our technique it can be easily embedded in any steganographic cover medium by using any steganographic algorithm.
Showing items related by title, author, creator and subject.
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
Modelling pile capacity and load-settlement behaviour of piles embedded in sand & mixed soils using artificial intelligenceAlkroosh, Iyad Salim Jabor (2011)This thesis presents the development of numerical models which are intended to be used to predict the bearing capacity and the load-settlement behaviour of pile foundations embedded in sand and mixed soils. Two artificial ...
Potdar, Vidyasagar; Han, Song; Chang, Elizabeth (2005)Watermarking, which belong to the information hiding field, has seen a lot of research interest recently. There is a lot of work begin conducted in different branches in this field. Steganography is used for secret ...